6 A connected graph \(G\) has five vertices and has eight edges with lengths \(8,10,10,11,13,17\), 17 and 18.
- Find the minimum length of a minimum spanning tree for \(G\).
- Find the maximum length of a minimum spanning tree for \(G\).
- Draw a sketch to show a possible graph \(G\) when the length of the minimum spanning tree is 53 .