The professor drives a Tesla to travel from city ? to city ?. The distance between cities ? and ? is ? miles. The Tesla can go up to ? miles before it needs a charge and there are many charging locations along the way including those in city ? and city ?. Professor wants to minimize the number of charges needed so he can get to his destination ASAP. Assume that at any charging location there is at least another charging location within a t mile radius.
For example, for ? = 10, t = 4 and the following charging locations (underlined)
(?)1 2 3 4 5 6 7 8 9 10 11(?)
the numbers of charges needed is 2 (at #4 and #8).
Save your time - order a paper!
Get your paper written from scratch within the tight deadline. Our service is a reliable solution to all your troubles. Place an order on any task and we will take care of it. You won’t have to worry about the quality and deadlinesOrder Paper Now
Professor ? promises to give you an A in his class if you can design a procedure to help him to achieve the goal. Does your procedure provide an optimal solution? Why or why not? Write a pseudo-code for your procedure. Show its correctness and complexity.
Please use C++.This is all of the given information.