$(10$ pts$)$ Consider the following pseudo code and calculate its complexity in terms of $n($size of the input$)$ in the notation n$+$c

function insertionSort$($L$)$

i $=1$

while i $$ length$($L$)$

j $=$ i

while j $>0$ and L$[$j$]$ L$[$j$-1]$

temp $=$ L$[$j$-1]$

L$[$j$-1]=$ L$[$j$]$

L$[$j$]=$ temp

j $=$ j $-1$

i $=$ i $+1$

return L