Strongly Connected Components Description A strongly connected coponent (SCC) of a directed graph G (V, E) is defined as a maximal set of vertices CC V such that for every pair of vertices u and v in C, the two vertioes are reachable from each other. In this lab assignment, you are asked to decompose a given directed graph G- (V,E into a collection of SCCs. Input The input wil have the following format. The first integer refers to the number of vertices, |v . The second integer is the nurnber of edges, IEI. Vert?xs are indexed by 0, 1, , -1. Then, two numbers appearing in each line means an edge (u,v). See the example given below Output Output the SCC ID of every vertex. A SCC's ID is defined as the smallest index of any vertex in the SCC. In other words, you have to output, for each vertex , the ID of the unique SCC the vertex v belongs to. You ust output the ID for each vertex, considering vertices in the order of 0, 1 , IV 1 Examples of input and output Imput 8 13 1 2 1 5 2 3 2 6 3 2 3 7 4 0 4 5 6 5 Output for problem2 0 0 2 2 0 5 5 What this answer implies is that the graph is decomposed into four SCCs, 0,1,1), 2,3), 5,6), 7 Note that all vertices in the same SCC have the same label, which is equal to the smallest index of all vertices in the sane component. For example, vertices 0,1 and 1 are all labeled with 0. See the lab guidelines for submission/grading, etc, which can be found in Files/Labs