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) I for each vertex u E G.V-s u"color = WHITE u,d = oo 5 s.color=GRAY sd = 0 4 9 ENQUEUE (Q,s) 10 11 10 while u = DEOUEUE(Q) 12 foreach v E G.Adiu) 13 12 13 if v.color WHITE .color = GRAY 15 16 17 ENQUEUE(.v) u,color = BLACK