01.Call BFS(G, s) over the following graph. Show each step of your calculation.

02.Write a pseudocode to detect all possible cycles in a di-graph. Verify your pseudocode using G_1.

03.Prove that the complexity of BFS (or DFS) is O(V+E). Explain/Verify your statement using your work in question 01.

04.Apply Dijkstras algorithm on the following graph (consider a as the source vertex) and list the path with minimum cost from a to c.

Explain the running time complexity of the algorithm.

05.Critical Path Analysis Find the critical path and the cost of critical path for the following set of tasks:

c a d