$(1)$ Pseudocode for unsertion sort is giuns in the book which is$,$

for $j=2toA.$ length

key $=A[j]$

$//$ insert $A[j]$ ento the sorted seq $A[1....j-1]$

$i=j-1$

while $i>o$ and $A[i]>$key

$A[i+1]=A[i]$

$i=i-1$

$A[i+1]=ky$

find the runtime for

a$)$ Best case.

B$)$ worst case.

use $($#$)$ notation