[2] Consider the following graph: 3 5 (i) 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.) (ii) Starting at vertex 1, and breaking ties by choosing the lowest vertex number, traverse the graph using depth-first search and construct the corresponding depth-first search tree (and, of course, draw the tree in your solution to this question). 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)