Graph Theory: Please perform prims algorithm on this graph part (4) show clear explanation and show the spanning tree and their weight thanks

1. (20 points) Using the graph below, show the spanning trees and their weights created by (1) breath-first search, (2) depth-first search, (3) Dijkstra's algorithm, and (4) Prim's algorithm. If the starting point is need by the algorithm, use vertex a. 5 12 1 21 16 17 19