Create an array of 1,000 integers sorted in numerical order. Write a program that runs each sorting algorithm with this array, timing each algorithm, and compare the times. Compare these times to the times for sorting a random array of integers. Refer to chapter 1 of the book to implement the time method. Write a sequential search method that finds the last occurrence of an item. Run the binary search method on a set of unordered data. What happens? (language=c#)