Question 4 (20 pts):

Question 4 (20 pts): The figure below represents the customer locations and distances between them in a logistical network (the table also provides the complete (symmetric) distance between the customers). 

Assume our vehicle is at customer-A location and needs to go back to same location. Find a low cost (low distance) tour and associated total distance that visits all the customers starting with customer A and ending at customer A using the nearest neighborhood heuristic using initial iteration point as customer A.