2a. Give an adjacency list representation for the directed graph below. Each list should be ordered alphabetically in ascending order.2b. Show how depth first search works on the graph, like how it is shown in Figure 22.4 (page 605). Assume s is the source vertex and that the depth first search procedure considers the vertices in alphabetical order.(5 extra points) Show the parenthesis structure.

Find the adjacency matrix of the given directed multigraph with respect to the vertices listed in alphabetic order.

Adjacency Matrix & List | Overview, Graphs & Examples