15. In branch and bound algorithm for solving a travelling salesman problem, we may initially consider a tour by considering travelling in the order 1-2-3-... -n. The distance covered in this tour would provide a lower bound on the total distance of the optimal tour. Mark the statement as T (True) or F (False).