Task 3: Snakes in a Graph For a graph G- (V, E), a snake (also called an induced path) is a path vi,v2,..., vk such that for all j-i>1 (vi,vj) f E. That is, it is a sequence of vertices in G such that each two adjacent vertices in the sequence are connected by an edge in G, and each two nonadjacent vertices in the sequence are not connected by any edge in G For this task, our goal is to determine the largest snake of a graph Input Format Input for this problem consist of a sequence of one or more (undirected) graphs taken from the keyboard. Each graph is represented by an adjacency list. The first line is an integer n indicating the order of the graph. This is followed by n white space separated lists of adjacencies for nodes labeled 0 to n - 1. The input will be terminated by a line consisting of one zero (0). This line should not be processed. Two sample input graphs are listed below. The easy (harder) test cases are graphs of order at most 10 (50) 4 0 3 1 4 0 2 1 3 4 2 4 0 2 3 0 Output Format Output will be just one integer per line sent to the console (e.g. System.out). For the above, input we would output the following two integers denoting the longest snake of the two graphs. Recall that the length of a path is the number of edges 2 Task 3: Snakes in a Graph For a graph G- (V, E), a snake (also called an induced path) is a path vi,v2,..., vk such that for all j-i>1 (vi,vj) f E. That is, it is a sequence of vertices in G such that each two adjacent vertices in the sequence are connected by an edge in G, and each two nonadjacent vertices in the sequence are not connected by any edge in G For this task, our goal is to determine the largest snake of a graph Input Format Input for this problem consist of a sequence of one or more (undirected) graphs taken from the keyboard. Each graph is represented by an adjacency list. The first line is an integer n indicating the order of the graph. This is followed by n white space separated lists of adjacencies for nodes labeled 0 to n - 1. The input will be terminated by a line consisting of one zero (0). This line should not be processed. Two sample input graphs are listed below. The easy (harder) test cases are graphs of order at most 10 (50) 4 0 3 1 4 0 2 1 3 4 2 4 0 2 3 0 Output Format Output will be just one integer per line sent to the console (e.g. System.out). For the above, input we would output the following two integers denoting the longest snake of the two graphs. Recall that the length of a path is the number of edges 2