undefined

Incorrect Question 1 0 / 4 pts Select the best answer. DFS(G) 1 for each vertex u E G.V 2 u.color = WHITE 3 U = NIL 4 time = 0 5 for each vertex u E G.V 6 if u.color == WHITE 7 DFS-VISIT(G,u DFS-VISIT(G,u) 1 time = time + 1 2 u.d = time 3 u.color = GRAY 4. for each v E G. Adj[u] 5 if v.color == WHITE 6 V. = u 7 DFS-VISIT(G,V) u. r = BLACK 9 time = time + 1 10 u.f = time Depth-First Search uses explicitly a queue. last-in first-out (LIFO) O first-in first-out (FIFO) O first-in Last-out (FILO) 0 None of these answers First Come Last Serve (FCLS)