What would the result be if you applied Prim's algorithm to a graph that is not connected?

' Jl \ tir:+ \)nv \vc{ rvr\ ft'\cu { {,\',rVc,fL"-,cr >o Dnr,er'trr',) eW - L c / /,-'-t-'7 WN -[ '["O, o^ 1.,r,,t/\ i,1 , fLun { ,str)crtn>,jul .l'(v).u At ,-/,*,rn J ,j4.*,tf ts dut,or!gr,v...t Clilict\...