2. Consider the (undirected) graph G having the following vertex set Vand edge set E. V-0,1,2,3,4,5,6,7,8,9 E- 0,1,10,2), 11,2;, 12,4), 12,3), 13,4), (4,5), {5.6,, 14,6, 2,7) a) [2pts] Draw the graph G. b) [4pts] Give the adjacency matrix of G. c[4pts] Give the adjacency list representation, where edges are added as they are listed in E above: d) [8pts] Show the action of DFS starting at vertex 2. Show action of stack, parent array implementation of DFS spanning tree and display nodes in order they are traversed. Choose next node as it occurs in the adjacency list. e) [8pts] Show the action of BFS starting at vertex 2. Show action of queue, parent array implementation of BFS spanning tree and display nodes in order they are traversed. Choose next node as it occurs in the adjacency list