Question 3 (Pitstop Planning, 40 points). Jake is a racecar driver. In the current race, he needs to take n laps around the course. Unfortunately, his car's performance slowly gets worse each lap he performs without taking a pitstop. In particular, a lap will take time T if Jake has gone laps since his last one. Unfortunately, Jake's pit crew has only materials to let him perform at most k pitstops over the course of the race. Give an O(kn2) time algorithm to determine which laps Jake should take pitstops in so as to minimize his total time to complete all n laps