Problem 3. (30 points)

Consider the following graph.

a

a) Write down the adjacency list and adjacency matrix 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) Starting at vertex a 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 stack) and the

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

c) Starting at vertex a 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.