Use C language only and no other programming language, the code needs to be able to run in CodeBlocks.

Much appreciated

3.2 Implementation Requirements (i) Write a C program to implement an algorithm based on Depth-First Search to test the connectivity of a given network. Input: Adjacency matrix (refer to sample program on page 6 for reading in an adjacency matrix) Output: The sequence that vertices are being visited The vertices of each connected component of a given graph The parent of each vertex (a vertex p is the parent of vertex c if c is visited from p) Note: To mark a vertex to indicate if has been visited or not, a one-dimensional integer array, say visit[maxV1, where maxV is the size of the array, could be used. visit i is set to 0 initially for all i (unvisited), and is set to 1 if visited (ii) Use your program to test the following network. A graph G(V,E) with the following adjacency matrix