You are given the following graph:

Starting at node $\backslash (\backslash$mathbf$\{$E$\}\backslash ),$ in which order will the nodes in the graph be visited by Prim's Algorithm?

Note: You must use the algorithm that was discussed in this course.

Note: If you encounter a node with multiple neighbors, you should visit its neighbors in alphabetical order.

Note: Order the items such that the first node to be visited is on top, and the last node to be visited is on the bottom.