solve this question using backward recursive

1) A travelling salesman has a trip from New York to California. Salesman should take three stopovers on the way. Several choices of towns for each stop in which there are several hotels to choose from in each city. Each stopover has a different distance resulting in different cost such as petrol and hotels. Define the best route to California that the overall cost of the trip is minimized. 50 70 50 Petrol cost 50 70 D G 22 10 70 start 70 H 8 25 70 L 60 80 Hotel cost 60 a. Define your stage(s) (5 points) b. Define your states(s) (5 points) c. Define recursive relation formula (10 points) d. Show your iterations clearly (30 points)