Determine the worst case, or Big $O$ complexity of the following algorithm,

def Algorithmia$)$:

$n=$len$(a)$

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

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

if a$[$j$]$ a $j+1$ :

temp $=a[j]$

$a[j]=a[j+1]$

$a[j+1]=$ temp

return a

$O(n^3)$

$O(n)$

$O(n^2)$

$O(nlog(n))$