Please there are no solutions to Chapter 4 of the Book Algor

Please there are no solutions to Chapter 4 of the Book \"Algorithm Design\"....could you please post the solutions

Thank you

Decide whether you think the following statement is true or false. If it is true, give a short explanation.If it is false give a counterexample. Let G be an arbritrary connected undirected graph with a distinct cost c(e) on every edge e. Suppose e* is the cheapest edge in G. Then there is a minimum spanning tree T of G that contains the edge e*

Solution

The above statement is True because, e* is the first edge that would be considered by the Krushkal\'s Algorithm for which it would be included in the minimum spanning tree.