Question $2$: Suppose Dijkstra's algorithm runs on the following graph, starting at node A$.$

a$)$ Draw a table showing the intermediate distance values of all the nodes after each iteration

of the algorithm. $(10pts)$

b$)$ Draw the final shortest path.$(5$ pts$)$

c$)$ Write the pseudocode of Prim's Algorithm. $(5$ pts$)$

d$)$ Illustrate the execution of Prim's Algorithm. Show the final MST$.$ What is the cost of its

$MST?(5$ pts$)$

e$)$ Illustrate the execution of Kruskal's Algorithm. Show the final MST$.$ What is the cost of

its MST$?(5$ pts$)$