Project: Project 5 The rest of the documentation. Create a list of random numbers store the numbers in an array and in a file the user will determine the number of numbers and the range of the random numbers when the program executes Keep one array with the original numbers and Another array with the sorted numbers Search for another random number in each array Keep track of the number of times in each search that we make a comparison. Calculate the average number of comparisons made when searching the unsorted list with searching the sorted list Display the results. Test: initially start with a small data size and make sure the program works Then when you have evidence that the program works then turn off the print data and create a very large data array--make sure that the random numbers are appropriate to the size of the data array. Computer science Java

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 x1, x2, . . , xn 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 d1, d2, . . , dn miles down the road. each scooter also has a price p1, p2, . . , pn that it takes to activate. any time you encounter another scooter, you may take the new scooter and leave your old scooter behind. there is an additional scooter at your house that you start with and it can go distance d0 miles and it is free to activate: p0 = 0. you wish to go to your friend’s house minimizing the total amount of money spent activating the scooters. design a dynamic programming algorithm that returns the minimum cost to get to your friend’s house using scooters x0, . . , xn.