Bubble Sort 1. Implement a bubble sort in C#, using arrays. The algorithm for the bubble sort is shown in listing 1. 2. The bubble sort should sort an array of randomly assigned integers. 3. Sort a random list of elements of 100, 1,000, 10,000, 25,000, 50,000, 100,000, 250,000, 500,000, 750,000, and 1,000,000 elements, respectively and the time it takes (in milliseconds) to complete each sorting operation. 4. Graph the results in Excel using a single graph.

procedure bubbleSort( A : list of sortable items )

n = length(A)

repeat

swapped = false

for i = 1 to n-1 inclusive do

if A[i-1] > A[i] then

swap(A[i-1], A[i])

swapped = true

end if

end for

n = n - 1

until not swapped

end procedure

5. Repeat steps 3 and 4 above, but instead of using the Bubble Sort algorithm, use the language supplied sort method to sort the arrays. Graph your results using a second Excel graph.