Consider the following undirected graph given by adjacency lists $($first column indi$-$

cates the vertex, the second column lists its neighbors as a list$)$:

$($a$)(4$ pts$.)$ Perform Depth$-$First Search on this graph starting from vertex $0.$ In$-$

dicate how the stack changes, the order in which the vertices are marked, draw

the rooted tree corresponding to the search, and list the edgeTo array.

$($b$)(4$ pts$.)$ Perform Breadth$-$First Search on this graph starting from vertex $0.$

Indicate the queue, the order in which the vertices are marked, draw the rooted

tree corresponding to the search, and list the edgeTo array.