Need help completing the attached programs in C#

The purpose of the project is to perform a timing experiment. You are required to complete the following activities:

Write a computer program that prompts the user for a number, creates an array for that number of random integers, and then usees the bubble sort to order the array. The

program should print out the array prior to the call to the sorting algorithm and afterwards. You can write the program in either Java, C$++,$ C#$,$ or whatever language you are

most comfortable in$.$ Do Not use an API from the language library. Write the program to perform the sort.

Repeat $1$ but use selection sort this time. Again, write out the program for the selection sort. DO not use the language library.

$1$ and $2$ are primarily intended to make sure that your algorithms work.

Once you are convinced your programs work, do the following

Write a computer program that prompts the user for one number, n for the number of items in the array to sort, and create and sort $1000$ different arrays of this size timing

the run to get an average time to sort an array of this size. Then do the following:

Initiate a variable running$\_$time to $0$

Create a for loop that iterates $1000$ times.

In the body of the loop,

Create an array of n random integers

Get the time and set this to start$-$time $($notice the sort is started after each array is built. You want to time the srt process only$).$ You will have to figure out what

the appropriate command is in the programming language you are using to find the time $($Important: Do not start the timer until after the array is created$).$

Use bubble sort to sort the array

Get the time and set this to end$-$time Subtract start$-$time from end$-$time and add the result to total$\_$time

Once the program has run, note

The number of items sorted

The average running time for each array $($total$\_$time$/1000)$

Repeat the process using $500,2500$ and $5000$ as the size of the array.

Repeat $3$ using selection sort.

You now have $6$ data points $($ the averages from the three array sizes for the two sort algorithms$)$ Create a spreadsheet showing the results of $3$ and $4$ and create a graph to

graphically represent the information. Show both sort algorithms on the same graph for comparison. e$.$g$.$