Logic problem, homework help

1) The following chart shows the mileage between different cities. A traveling salesman begins at Quarryville, visits all the cities once, and returns to Quarryville when done. According to the repetitive nearest neighbor algorithm, what path should the salesman take to minimize the distance traveled?

  Quarryville Union Albany Shawnee
Quarryville 530 686 622
Union 530 248 556
Albany 686 248 207
Shawnee 622 556 207