reusec + valenciacollege.instructure.com/courses/133472/assignments/3359599 Courses r Class EDF2005 in. MyLab Math | Pear.. Service Hours Portal (S) FAFSA @ My CliftonStrength.. P pandora w |Office 365 V|Atlas Login - Valen. 2 Credit Courses 1. Darren works for US Paper Products in New York City. His company is investigating locations for a new factory that will produce a line of disposable clothing. The cities Darren needs to visit are Atlanta, Dallas, Philadelphia, and Washington, DC. The one-way flight prices between these cities are given in the table below ncements Cities and Cost of Travel es Atlanta Dallas New York Philadelphia Washington ssions Atlanta $182 $19 $159 $180 Dallas $182 $115 $115 $110 b and ring New York $197 $115 $55 $156 Philadelphia $159 $115 $55 $205 Washington $180 $110 $156 $205 ent Feedback on uction a.) Represent the traveling salesman problem with a complete, weighted graph showing the prices of the flights on the appropriate edges. ickly Tools ary b.) Use the nearest neighbor method to approximate the optimal route for Darren to travel to each city and infuse return to New York City. Give the cost of the route determined. c.) Create your own algorithm and see if you can find a route that costs less than the route you calculated in 8 0 0 0 9:04 AD C OII K $ O @ 5 2 3 O p t e y U W h K