Consider this graph: f) d a A. Write down the adjacency matrix representation for this graph, as well as the adjacency list representation (assume nodes are kept in alphabetical order in the lists). B. Starting at node a, traverse the graph depth-first search, resolving ties by taking nodes in alphabetical order. Along the way, construct the depth-first search tree. Give the order in which nodes are pushed onto to traversal stack, and the order in which they are popped off. C. Traverse the graph by breadth-first search instead. Along the way, construct the breadth first search tree