A delivery truck must plan a tour that visits $\backslash$table$[[,0,1,2,3,4,5],[0,-,17,18,7,25,6],[1,17,-,28,15,16,19],[2,18,28,-,26,19,27],[3,7,15,26,-,20,14],[4,25,16,19,20,-,19],[5,6,19,27,14,19,-]]$customers$,$ leaving node and returning to node at the end of the tour. The distance between each pair of nodes is given in the table below.

$1$Find the tour and total distance using the nearest neighbor algorithm