Professor gekko has always dreamed of inline skating across north dakota. he plans to cross the state on highway u. s. 2, which runs from grand forks, on the eastern border with minnesota, to williston, near the western border with montana. 428 chapter 16 greedy algorithms the professor can carry two liters of water, and he can skate m miles before running out of water. (because north dakota is relatively flat, the professor does not have to worry about drinking water at a greater rate on uphill sections than on flat or downhill sections.) the professor will start in grand forks with two full liters of water. his official north dakota state map shows all the places along u. s. 2 at which he can refill his water and the distances between these locations. the professor’s goal is to minimize the number of water stops along his route across the state. give an efficient method by which he can determine which water stops he should make. prove that your strategy yields an optimal solution, and give its running time.