pls a and b solution

PROBLEM 5 = 2+8+3=13 Consider the following directed, weighted graph: 2 N 2 13 22 A E m 20 9 11 4 Oe 13 G H >He 17 g A) Use Dijkstra's algorithm to calculate the single-source shortest paths from vertex A to every other vertex B) Step through Prim's algorithm to calculate a minimum spanning tree starting from vertex A. A B Prim's MST=) DE F G H