$1.$ Consider the following graph: $($NOTE: NO ALGORITHM REQUIRED$)$

Considering A to be your source node. As you explore the graph, make sure to navigate in alphabetic order to traverse the graph to answer the following:

a$.$ Execute Dijkstra's algorithm on this graph. Show the distance changes at each step. Your source is Vertex A$.$

b$.$ Execute Topological Sort on the graph and write the sequence of vertices. You have to identify and begin at a source $($DAG definition of source$).$

c$.$ Execute Kruskal's algorithm on this graph. Show the edges that you would add in the MST$.$

d$.$ Execute Prim's algorithm on this graph. Show the edges that you would add in the MST$.$

e$.$ Perform BFS on the graph. Write the sequence of vertices as you execute. Your source is A$.$

f$.$ Perform DFS on the graph. Write the sequence of vertices as you execute. Your source is A$.$