What is the complexity of the code below

def mode$($a$)$:

$$ a$.$sort$()$

$$ acc, val, occ $=1,$a$[0],1$

$$ for i in range$(1,$len$($a$))$:

$$ if $($a$[$i$-1]==$a$[$i$])$:

$$ acc $+=1$

$$ else:

$$ if $($acc $>$occ$)$:

$$ val $=$a$[$i$-1]$

$$ occ $=$acc

$$ acc $=1$

$$ return val