1.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. 2.Compare these times to the times for sorting a random array of integers.

2.Write a sequential search method that finds the last occurrence of an item. 3. Run the binary search method on a set of unordered data. What happens?

(Language=c#)

Note- pls provide words format.