Gas Station Problem. Suppose that you have a robot that is tasked with traveling from start to goal. In this problem, we assume that we already know the path that will be followed by the robot

Gas Station Problem. Suppose that you have a robot that is tasked with traveling from start to goal. In this problem, we assume that we already know the path that will be followed by the robot. This path is a straight road from the start, ro, to the goal zn Our robot has limited fuel and will need to stop along this path (possibly multiple times) to refuel. The robot spends one unit of fuel per unit distance traveled. There are n gas stations along the path: zo z x2 . . . Zn. The ith gas station, z, is at a distance di from the start. It costs pi dollars per unit of fuel to refuel at the ith station. Our objective is to minimize the total cost of refueling while ensuring the robot reaches the goal position