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- ucolor = WHITE u.? = NIL 4 5 s.color=GRAY 6 s.d =0 4 9 ENQUEUE (Q.s) 10 11 ) 10 while Q* u = DEQUEUE(O) 12 for each v E G.Adil 13 if v.color WHITE 12 13 vcolor GRAY 15 16 17 18 ENQUEUE(.v) u,color = BLACK