Question 2 (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 s,color = GRAY 6 s,d = 0 4 9 ENQUEUE (Q,) 10 while Q? 12 foeach vG.Adju] if v.color. WHITE v.colorGRAY 13 15 17 12 13 ENQUEUE (Q,V) 18 u"color = BLACK