AQA D1 paper (June 2006 5a) Gill is solving a travelling salesperson problem. Write down the best upper bound chosen from 7.5, 8, 7, 7.5, 8.5 (it's 7 and I agree) Now which is the best lower bound chosen from 6.5, 7, 6.5, 5, 7 ? They say 7, but why not the smallest value of 5? Also, although I haven't had this question from a student yet, when applying lower bound algorithm and finding minimum connector for network with two edges removed, does this have to create a tour allowing start and finish vertex to coincide, or is a minimum spanning tree (which does not) permissible to obtain this theoretical minimum value. Textbook suggests the latter. Any advice/wisdom appreciated thanks.