Given the following function that sorts an array of values:

void bubblesort$($double$[]$ array$)\{$

for $($int $i=0$;$i$ array.length; $i++)$

for $($int $j=$ array.length $-1$;$j>i$; j$--)$

if $($array$[$j$]$ array $[j-1]$

swap $($array$,$ j$,$ j $-1)$;

$\}$

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.$