consider the pseudo-code for Bubblesort:

Bubblesort(A,n)

n=length[A]

for i=1 to n-1:

for j=n downto i+1:

if A[j] < A[j-1]

then Swap A[j] with A[j-1]

Do the analysis to find the worst-case running time for Bubblesort.

. How does it compare to the running time of Insertion-Sort?

Hi, Could you please help me to solve the question. Also, could you please answer questions in clear hand-writing and show me the full process, thank you (Sometimes I get the answer which was difficult to read).Thanks a lot.