$8$b$.(5$ points$)$ Prim algorithm is used to find a Minimum Spanning Tree $($MST$)$ in a graph. It maintains a min$-$priority queue Q internally when selecting a new edge to be added. Given the graph in $8$ a and pseudocode below, choosing A as the root, show the Q after all insertions, then trace Q after each while loop. For each of the element in $\backslash ($ Q $\backslash ),$ show its key as well, e$.$g$.\backslash ($ Q$=\backslash \{$A$|2,$ B$|3,$ C $\backslash$mid $\backslash$infty$,\backslash$ldots$\backslash \}\backslash ).$

Your answer:

Q after all insertions:

Q after each while loop: