Answer: True
Explanation:
The definition of minimum spanning tree(MST) says that the graph must be connected and undirected to be considered for MST. It has (V-1) edges where V is the number of vertices. The minimum spanning tree is implemented using Kruskal's algorithm whereby it starts by considering the minimum weighted edge and covers all the edges upto (V-1) edges. So for MST it has to be connected
The answer is yes I hope this help ya out
Answer:
kbfbnmcj hbx nmjn mz kjn mj hk hhhhhhgdhggbddddddbvgfcgfctrctgvhyubujbnjinkikmokimloplkmkojihgftrdesw3l,kmjinhuygtfrde4sw34drftyghuijokkkkkkkkkkkkkkkijjjjjjjkopl[[[[[koiju98hytttttttttttttuhiouhygdtrsgyuihkl;;ihugydtrcfbhjklioutrcgfbhjkloiuytdrhjukliuytrdgfhjkiouy7gfhjklpoiudtrkhjl;[poiughjbnm,;lkihuygtfvbnmjkiuytfgchvbnmkjlhuygfdc vbnhnjkygtdsfxghbjkiuhytrdgfhjuioytrdfgchbnmkloiuytfdfghjiouyyyyyyhjkpoi8u97t6rdghjuo0987hjklpo0i98uyghjbkopiuyhjbnkploiuhyjbnmkloiuhygbvjnmk,l;oipuhgbjkn mjhuygfvbnhjkiouuuukjopipkjmloiujoklm;okjm,kloiuhjnmkiuhjbkiuygfhuji8yghyugfvhjkjiuhygfhuijokpiuyt67u89poiuhygftduhjklphuytfrdesdtgyuhi;lkyuuuugij'[;;;;;;;;;;;;;;;;;;;;okpuuuutyyyyy[poiudtryuiop[;oiudtrruiooooooooytg[pl;oiuhygtfffkjjjjhugvcfxkml,;kjnhbgvchbjnk,lijuhygfcbvh nmmpoiugyhjb,m ./[poiuhbjnm,k;lijuytfrcgbvhkjlipouuuujipouuuukliouygkjliubhjkml
Explanation:
Assumption - hope this helped took the test and got 100