python runtime

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 reverse1(lst): rev lst -[ while(i -0) rev lst.append ( lst[i]) return rev lst 1. If lst is a list of n integers, what is the worst case running time of reverse1(lst)? Give a short explanation of your answer. Your Answer: 2. If lst is a list of n integers, what is the worst case running time of reverse2(lst)? Give a short explanation of your answer. Your