Question

For minimum spanning tree (MST) construction, Prime’s algorithm selects and edge
1) with minimum weight so that cost of MST is always minimum
2) with maximum number of vertices connected to it so that MST has at least diameter
3) that does not introduced a cycle
4) that adds a new vertex to partially constructed tree with minimal increment in cost of MST

Answer 1

2)with maximum no.of vertices connected to it so that MST has at least diameter.

Answer 2

$\huge \mathfrak{Hola}$

____________✉

▶Correct option is 2♍

➡With maximum number of vertices connected to it so that MST has at least diameter.