Consider the following graph (15 Points). E R K A V a) Show the representation of the graph above in an Adjacency matrix. b) Show the representation of the graph above in an Adjacency list. c) Use the Breadth-First strategy to traverse the graph above. List the vertices in the order in which breadth first search traverses them. d) Use the Depth-First strategy to traverse the graph above. List the vertices in the order in which Depth first search traverses them. In addition, show the type of each edge, i.e., edge classification.