Write a program in C language that follow (a.b.c.e) in tesk1

Please solve by expert and make it clear to understand

Task 1: Application of Graph System Details: a) Create a program to input a graph G = (V,E) as an adjacency matrix. Include function to:- i Test if G is complete ii. Obtain a path and a simple path from vertex u to vertex v Include two functions BFT and DFT to undertake a breadth first and depth first traversal of the graph iv. Making use of the traversal procedures to test whether the graph is connected ini. Task 2: Complexity Analysis - Theoretically discuss and compute the complexity of all algorithms that you implemented. The discussion will describe your understanding of the algorithm. Put the complexity on a table as shown in Table 1. Table 1: Complexity Analysis Algorithm Algorithm 1 Algorithm 2 Complexity Oflog n) O in) Task 1: Application of Graph System Details: a) Create a program to input a graph G = (V,E) as an adjacency matrix. Include function to:- i Test if G is complete ii. Obtain a path and a simple path from vertex u to vertex v Include two functions BFT and DFT to undertake a breadth first and depth first traversal of the graph iv. Making use of the traversal procedures to test whether the graph is connected ini. Task 2: Complexity Analysis - Theoretically discuss and compute the complexity of all algorithms that you implemented. The discussion will describe your understanding of the algorithm. Put the complexity on a table as shown in Table 1. Table 1: Complexity Analysis Algorithm Algorithm 1 Algorithm 2 Complexity Oflog n) O in)