<p>Need help to answer this question with explanation please</p><p><img alt="10) The goal of the Traveling Salesman Problem (TSP) is to determine a shortest route (tour) that starts at the salespersons
<br/><img src="https://media.cheggcdn.com/media%2F3c0%2F3c0076fd-76d1-4920-a2b9-0ec0afb72cd6%2Fimage" alt="2 In the circular double linked list, the operations are as follows to insert the node pointed by S before P: S->next P: S>prior : P>prior->next - S: