A traveling salesperson needs to visit cities {AH} to determine whether things progress well in the company's stores. The distance between each city is presented in the following table. By using the Nearest Neighbor Algorithm, find a Hamiltonian Circuit assuming that the headquarters office is at city D; that is, the cycle starts at vertex D. 4 We know that Nearest Neighbor Algorithm is a greedy heuristic algorithm which gives a quick and good enough solution. Considering that the network is fully connected, that is, each node is connected to every other node, determine the number of Hamiltonian Circuits that we had to enumerate to find the optimal solution. (Please note that the computational load of this method leads us to adopt heuristic algorithms to solve a TSP problem.)