Consider the following graph. (a) Write down the adjacency matrix and adjacency lists specifying this graph. (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 traversal stack) and the order in which the vertices became dead ends (popped off the stack). (c) Traverse the graph of Figure 1 by breadth-first search and construct the corresponding breadthfirst search tree. Start the traversal at vertex a and resolve ties by the vertex alphabetical order