Consider the following directed graph: 1. Give an adjacency-matrix representation of the graph. 2. Give an adjacency-list representation of the graph, assuming that the vertices in adjacency lists are ordered alphabetically. 3. Show the distances that result from running breadth-first search on graph, using vertex u as the source. 4. Perform a DFS search on the graph. Fill in the parent, discovery time, and finishing time for each vertex