Create a sorted array as described in the previous project. Create another array of 1000 unsorted integers selected at random from the sorted array. a. Search the sorted array for each value in the...

Create a sorted array as described in the previous project. Create another array of 1000 unsorted integers selected at random from the sorted array.

a. Search the sorted array for each value in the unsorted array by using a linear search.

b. Search the sorted array for each value of the unsorted array by using a binary search.

c. Calculate the average execution time for each of the previous two searches and compare the efficiencies of the two algorithms.