(10 pts. total) A traveling salesman has to fly from the home base in Orlando to Atlanta, New York, and Chicago (although not necessarily in that order) and then return home. The current airline ticket prices in $ are given in the table below. a) Draw a weighted graph that represents this problem in the space below. Use the first letter of the city when labeling each vertex. b) Find the weight (price) of the Hamiltonian circuit formed using the nearest neighbor algorithm. Give the vertices in the circuit in the order they are visited in the circuit as well as the total weight (price) of the circuit. Remember to include the unit of measre in your final