Advanced algorithms

Question 1 (30 POINTS): Given a graph G and the Breadth First Search (BFS) and Depth First Search (DFS) traversal algorithms as follows BFS(G, s) 1 for each vertex u e G.V-s u.color WHITE 4 5 s.color=GRAY 4 9 ENQUEUE (Q, 10 11 ) 10 while Q u-DEQUEUE(Q) 12 for each v e G.Adiu 13 12 13 if v. color WHITE color = GRAY 15 16 17 18 ENQUEUE(.v) u,color = BLACK DFS-VISIT (G, u) DFS(G) 1 for each vertex u E G. V timetime +1 2 u,d= time u . color for each v e G. Adj[u] u.colorWHITE = GR AY 4 4 time0 5 for each vertex u E G.V if v.color WHITE if 11 . color == W H ITE DFS-VISIT (G,u) DFS-VISIT (G, v) 8 u.color BLACK 9 time-time1 10 u,f= time