Travelling Salesman Problem - application

In this project, a shortest tour is found starting from City-1 and finally returning to it, while visiting other cities only once. The coordinates of the cities are City-1(0,0), City-2(2,6), City-3(8,4), City-4(7,2), City-5(1,6), City-6(4,9), City-7(3,2) You need to find the tour in terms of the sequence of the cities visited and the traveling distance. As the output, present the path and the distance traveled. The program should be coded using C language. And please add the algorithm adapted and the flow chart file. It should be the shortest tour.