QUESTION 25 Trace the BFS algorithm on this undirected graph to traverse it starting from vertex 4, and figure out which vertices lead to which other vertices. For reference, the BFS algorithm is shown. Use the adjacency list below for the order (read left to right) of the nodes explored and follow the trace format started below 2 3, 2. 11 4. 0 3. 4, 2.0 3. 1 Algorithm Breadth-first traversal algorithm overview * . enqueue the starting vertex. and mark it as visited loop until queue is empty o dequeue first vertex and add it to iterator o enqueue each unmarked vertex adjacent to the dequeued vertex o mark each vertex enqueued as visited (Lewis and Chase Trace Initially queue [4] visited-vertices-[4] node_container After loop 1: queue [FILL INI I/front is on left visited vertices FILL IN)I/will be kept sorted for convenience node-container = FILL IN] //iterable object to record nodes traversed, first item is on left