Q4) [7 points] Consider the following graph 1. 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.) 2. Traverse the graph by depth-first search Show the traversal stack- show 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) .Construct the corresponding depth-first search tree. 3. Traverse the graph by breadth-first search Show the traversal queue- show the order in which the vertices were reached for the first time (inserted into the traversal queue) and the order in which the vertices were removed from the queue. ,()iisiruci; then @omneaptinelliieg bie%2elih.firsi: sesaliti' 'the 0 In 2, and 3, start at vertex a and resolve ties by the vertex alphabetical order