$[2$ pts$]$ For the following Bubblesort algorithm, how many times would the inner for loop iterate $($give the closed form$)?$ What is the worst$-$case running time of Bubblesort?

BUBBLESORT$(A)$

for $i=1$ to A$.$length $-1$

for $j=$ A$.$ length downto $i+1$

if $A[j]A[j-1]A[j]\frac{?}{\frac{?}{?}}$

downto means $dcreaseby1$

exchange $A[j]$ with $A[j-1]$