3. Given the following function that sorts an array of values: void bubblesort (double[] array) \{ for (int i=0;ii;j ) if (array[j]j,j1 ); Let n be the length of the array. Using summation evaluation, determine the number of swaps that are performed in the worst case as a function of n