Question $6$ : Ricky wrote a code $($using Prim's Algorithm$)$ that generates MST for a graph with $1000$

nodes and $1700$ edges. Unfortunately, during execution, a bug terminated Ricky's code, generating a

partial tree with $400$ edges instead of the expected MST$.$ Prove or disprove the following claim. First,

write your response then justify.

I. After adding the $400$ edges, the partial tree is still an MST$.$

II$.$ The partial tree is connected After adding the $400$ edges.