6. For the following city distance graph (from https://cs.nyu.edu/courses/fall16/ CSCI-UA.0102-001/Notes/cities.gif) 4086 London ague 3463 643 352 5278 723 5305 7 692 3179 3196 7840 Shanghai 4697 Buenos Ai Accra (a) Use Prim's algorithm to construct a minimum spanning tree for this city-distance graph. You don't need to draw the tree, just give the sequence of edge weights as they are added to the tree. 10 points Answer only; no explanation needed. (b) Use Kruskal's algorithm to construct a minimum spanning tree for this city- distance graph. You don't need to draw the tree, just give the sequence of edge weights as they are added to the tree.[10 points] Answer only; no explanation needed