1. (25) IGas stops] (adapted from an exercise in Cormen et al Introduction to Algorithms) We want to drive from one city to another city. Assume that the car's gas tank can hold enough gas to run n miles, and assume that we have a map showing the distance between nearest gas stations on the way. We want to make as few gas stops as possible along the way. Outline a greedy algorithm for determining at which gas stations we want to stop to refill the gas, and prove that the greedy strategy guarantees an optimal solution. Assume no two nearest gas stations are farther than n miles from each other. Hint: use "the greedy algorithm stays ahead" approach to prove the optimality wew gas stops as possible along the il the gas, andprove that