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
<span>The answer is False. When declaring an array, we use 1 set of square brackets.</span>
Obtaining a college degree= while this is nice, you can get a lot of placed with just a GED or Highschool Degree
pursuing self-directed learning=this will help you
showing professional behavior= yes this helps a lot
setting long-term goals= this could help you in the end game
Overall, i think it would be between B and C, though C sounds correct over B because even if you pursue self directed learning, you could still get fired or quit or not get a promotion.
Most likely B. Photographs.
Hope this helps!
Have a good day!
