What are the best and worst case time complexities of the followingmystery function: v o i d atreyastopsecretfunction (a [ 0 , 1 , 2 . . n ] )f o r i : =1 t o n : j : = i w h i l e ( j> 0 ) and (a [ j−1]> a [ j ] ) : swap (a [ j ] , a [ j−1 ] ) j : = j−1