1. You are given a graph.
2. You are required to find and print if the graph is connected (there is a path from
every vertex to every other).Input Format
Input has been managed for you
Output Format
true if the graph is connected, false otherwise
Constraints
None
Notice
Try First, Check Solution later
1. You should first read the question and watch the question video.2. Think of a solution approach, then try and submit the question on editor tab.3. We strongly advise you to watch the solution video for prescribed approach.Example
Input
7 5 0 1 10 2 3 10 4 5 10 5 6 10 4 6 10
Output
false