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
I’m not sure how to answer that
Answer:
Her performance over the course of a season.
Explanation:
An athlete is signed for a season. These days each aspect of an athlete is noted through the effective use of the best technology. However, for detailed study, one or several plays, and certainly not the second half of a game is enough. It's required to collect the details for a complete season. And that is possible, as an athlete is hired for a season. And through such a detailed data set of a complete season, we can now train a machine as well, and it will let the athlete know where she is going wrong. And thus she can improve and remove those faults from her game, and become a better athlete. And even for a coach, one complete season is required, though when he has not seen her playing before that season. It's assumed that this is her first season. All the options mentioned are good, but the best is certainly the one with complete details, and that is a complete season. The rest is good but not the best.
