Breadth First Search and Depth First Search

a$)$ Represent this graph using adjacency lists. Arrange the neighbors of each vertex in alphabetical order.

b$)$ Show the steps of a breadth first search with the graph using the technique given in the class notes. Use the adjacency lists representation that you created. Start at vertex A$.$ As part of your answer, produce a graph that has the vertices numbered according to the order in which they were processed$/$visited$.$

c$)$ Show the steps of a depth first search with the graph using the technique given in the class notes. Use the adjacency lists representation that you created. Start at vertex A$.$ As part of your answer, produce a graph that has the vertices numbered according to the order in which they were processed$/$visited$.$