In Prim’s algorithm, a minimum spanning tree is built by expanding outward from an in a sequence of _____.

To fill in the blank in the statement, “In Prim’s algorithm, a minimum spanning tree is built by expanding outward from an _____ in a sequence of ______.”

Given information:

The statement is given as, “In Prim’s algorithm, a minimum spanning tree is built by expanding outward from an _____ in a sequence of ______.”

In Prim’s algorithm, one vertex is selected first and then the least weighted edge that connect with the selected vertex is determined. That edge and the connected two vertices are set to the minimum span tree. Then, for the two vertices, the least weighted edge selected again same as in the previous step. Every time one edge and one vertex are selected to enter the spanning tree...