1. Problem 23.1-6, page 630 (20 points).

2. Bottleneck Spanning Tree (20 points). A bottleneck spanning tree T of an undirected graph G is a spanning tree of G whose largest edge weight is minimum over all spanning trees of G. We say that the value of the bottleneck spanning tree is the weight of the maximum-weight edge in T.
Argue that a minimum spanning tree is a bottleneck spanning tree.

3. Problem 23.2-2, page 637 (20 points).

4. Problem 23.2-8, page 637 (20 points).

5. Problem 24.3-10, page 664 (20 points).

Note: thoroughly justify all your answers.