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 reverse1(lst): rev_lst = [] i = 0 while(i < len(lst)): rev_lst. insert(0, lst[i]) i += 1 return rev_lst def reverse2(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. What is the worst case running time of reverse1(lst)? Explain of your answer. 2. What is the worst case running time of reverse2(lst)? Explain of your answer.