Parts d and e only . thank you

For the graph shown in the figure below. (a) Classify the graph as either a directed or undirected graph. (b) Represent the graph using an adjacency list. Assume that adjacent vertices in each neighbors list are ordered alphabetically. (c) Represent the graph using an adjacency matrix. (d) Perform a breadth-first search (BFS) traversal on the graph starts at node a and draw the resulting breadth-first tree. (e) Perform a depth-first search (DFS) traversal on the graph starts at node a and draw the resulting depth-first tree. Follow the same order that you have in your adjacency list