Part a
Explain, with reference to the properties of a Minimum Spanning Tree (MST) and a Travelling Salesman Problem (TSP) tour, how the weight of an MST can be used to establish a lower bound for the length of a TSP route in a complete graph representing cities and distances.