1. Answer parts (a) and {b} with tables or diagrams. [a] Show how you would represent the above graph using adjacency lists. {b} Show how you would represent the above graph using an adjacency matrix. [c] Show the order that the nodes would be visited in a breadth rst and depth rst traversal starting from the vertex v6, respectively. Assume that whenever the traversal offers a choice of which node to visit rst. you will choose the smallest numbered node available