Suppose you were to drive from madison to rapid city (black hills), south dakota along i-90. your gas tank when full holds enough gas to travel m miles and you have a map that gives distances between gas stations along the route let d1 < d2 < < dn be the locations of all the gas stations along the route where di is the distance from madison to the gas station i. you can assume that the distance between neighboring gas stations is at most m miles. your goal is to make as few gas stops as possible along the way. give a greedy algorithm you can find to determine at which gas stations you should stop and prove that your strategy yields an optimal solution.