2. 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 Ti, 32,... ,...
Please show your work. Thx! 2. 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 Ti, 32,... , x,n 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 di, d2,... , dn miles down the road Any...
We are given n,x1,x2,...,xn,d1,d2,...,dn,D. The graph is not given and it should be constructed. The time it takes to construct a graph is part of the overall time complexity, so it should be included. The solution is your algorithm, which includes the graph construction. It is fine if the algorithm consists of several parts, which perform different tasks. The algorithm should return the actual path.The proof and run-time analysis should be provided for the entire solution/algorithm. Please show your wrok....