Suppose you and your friend live on the same street D miles away from each other. Between your house and your friend’s house there are n motorized scooters positioned at distances x1, x2, . . . , xn miles from your house towards your friend’s house. Each scooter has a battery that may or may not be fully charged. Let’s say that the scooters can take you distances d1, d2, . . . , dn miles down the road. Each scooter also has a price p1, p2, . . . , pn that it takes to activate. Any time you encounter another scooter, you may take the new scooter and leave your old scooter behind. There is an additional scooter at your house that you start with and it can go distance d0 miles and it is free to activate: p0 = 0. You wish to go to your friend’s house minimizing the total amount of money spent activating the scooters. Design a Dynamic Programming algorithm that returns the minimum cost to get to your friend’s house using scooters x0, . . . , xn.