Question $1$:

Consider the following two implementations of a function that if given a list, lst$,$ create and return a new list containing the elements of lst in reverse order.

def reverse$1($lst$)$: rev$\_$lst $=[]$

i$=0$

while$($i $<$ len$($lst$))$:

rev$\_$lst$.$insert$(0,$ lst$[$i$])$

i $+=1$ return rev$\_$lst

def reverse$2($lst$)$: rev$\_$lst $=[]$

i $=$ len$($lst$)-1$ while $($i $>=0)$:

rev$\_$lst$.$append$($lst$[$i$])$

i $-=1$ return rev$\_$lst

If lst is a list of n integers,

$1.$ Whatistheworstcaserunningtimeofreverse$1($lst$)?$Explainofyour

answer.

$2.$ Whatistheworstcaserunningtimeofreverse$2($lst$)?$Explainofyour

answer.