Consider the following graph $($edge weights are not shown as they are irrelevant$)$:

Suppose Prim's algorithm is being run on this graph $($starting from vertex $1),$ and the

following edges $($indicated by thick blue lines$)$ have been added to the minimum

spanning tree so far:

How many edges must the algorithm consider when choosing the next edge to add to

the MST$?$