Please solve this quastion quickly

= QUESTION 4: [17 POINTS) We consider the directed graph G = (V, E) shown below, and assume that the adjacency lists for all vertices are sorted by increasing vertex indices. DE 5 6 A) [8 POINTS] Run DFS(G) and show discovery time, finish time and predecessor for each node. And show the DFS forest. B) [2 POINTS] How many times in total has DFS-Visit has been called? C) [7 POINTS] Run BFS (G, O) starting with source 0. Show the Queue after each step. Show also d[], p[] lists and BFS tree