Subject = algorithm and Data Structures Computer language = C

Task 1 = provide a program code that full fill all requirements with output.

Task 2 = discuss and compute the complexity of all algorithms that implemented in the program code . Put the complexity on a table as shown in Table 1.

i. Task 1: Application of Tree System Details: a) Create a program to input a graph G = (V,E) as an adjacency matrix. Include function to:- 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 Making use of the traversal procedures to test whether the graph is connected iv. 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 Odlog n) (n)