b$)$ Using the same graph as in Part a and the same starting vertex e$,$ use Prim's algorithm to find a minimum spanning tree. Draw EACH PARTIAL TREE after the next edge has been added, until the complete MST is optained. $($Do not just list the edges added... I really want you to draw each partial tree.$)$