Analyse the worst case time complexity of the following version of bubblesort. Give an upper $($i$.$e$.$ O$)$ bound. Here is a Python implementation of bubblesort $($see the text for a pseudocode version$).$

def bubble$($A$)$:

n$=$len$($A$)$

for i in range$(0,$n$-1)$:

for j in range$($n$-1,$i$,-1)$:

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

A$[$j$],$A$[$j$-1]=$ A$[$j$-1],$A$[$j$]$

if $\_\_$name$\_\_=="\_\_$main$\_\_"$:

from random import randrange

A $=[$ randrange$(10,100)$ for i in range$(12)]$

bubble$($A$)$

print$($A$)$