Suppose that an emergency vehicle drives from city A to city B over a straight highway that is split in n segments. Each segment i has a length l; and a speed limit u. The driver has special permissions that allow her to violate the speed limit by v units for a total time T. Specifically, for each segment i E {1,2,...,n}, the driver has to choose for which duration ti >0 she will travel with the higher speed u; + v, under the constraint that the total violation time 2-1 t; is at most T. Devise a polynomial-time greedy algorithm that will allow the driver to go from city A to city B in a minimum amount of time, if she is allowed to violate the speed limit for a total time T and by v units of speed. Prove the correctness of your algorithms and give a Big-O bound on the running time as a function of n. Suppose that an emergency vehicle drives from city A to city B over a straight highway that is split in n segments. Each segment i has a length l; and a speed limit u. The driver has special permissions that allow her to violate the speed limit by v units for a total time T. Specifically, for each segment i E {1,2,...,n}, the driver has to choose for which duration ti >0 she will travel with the higher speed u; + v, under the constraint that the total violation time 2-1 t; is at most T. Devise a polynomial-time greedy algorithm that will allow the driver to go from city A to city B in a minimum amount of time, if she is allowed to violate the speed limit for a total time T and by v units of speed. Prove the correctness of your algorithms and give a Big-O bound on the running time as a function of n