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?

1. [3 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 it! if AUl A-1] 4 exchange AUl with AU-1]