Consider the following graph.

a$.$ Follow the textbook procedure, write down the adjacency matrix and adjacency lists specifying this

graph. $($Assume that the matrix rows and columns and vertices in the adjacency lists follow in the

alphabetical order of the vertex labels.$)$

b$.$ Follow the textbook procedure, starting at vertex $x$ and resolving ties by the vertex alphabetical order,

traverse the graph by depth$-$first search and construct the corresponding depth$-$first search tree. Give the

order in which the vertices were reached for the first time $($pushed onto the traversal stack$)$ and the order

in which the vertices became dead ends $($popped off the stack$).$

c$.$ Follow the textbook procedure, starting at vertex $x$ and resolving ties by the vertex alphabetical order,

traverse the graph by breadth$-$first search and construct the corresponding breadth$-$first search tree. Give

the order in which the vertices were reached for the first time $($inserted into the queue$).$