3) Which of the following statements about the minimum spanning tree (MST) problem is/are correct? A. We can use Prim's algorithm to solve the MST problem, and it is basically an algorithm of dynamic...

Extracted text: 3) Which of the following statements about the minimum spanning tree (MST) problem is/are correct? A. We can use Prim's algorithm to solve the MST problem, and it is basically an algorithm of dynamic programming (DP). B. We can use Kruskal's algorithm to solve the MST problem, and it is basically an algorithm of DP. C. We can formulate the MST problem as a linear program. D. Any pair of nodes in the MST of any graph must be connected. Е. None of the above are correct.