Please answer the 4th question.

1. (2 points) Let A be an array of size n26 containing integers from 1 to n- 5, inclusive with exactly five repeated. Describe an O(n) algorithm for finding the five integers in A that are repeated. (Goodrich, p. 150) formed as the sum of two integers in L. (Goodrich, p. 266) 3. (2 points) Describe how to implement a stack ADT using two queues. What is the running time of the push),and 4. (2 points) Propose a data structure that supports the stack push and pop operations, and a third operation findMin, 5.2 points) If the recursive routine on page 59 of the text used to compute Fibonacci numbers is run for N= 50, is stack pop () function in this case? (Goodrich p. 224) which returns the smallest element in the data structure, a in O(1) worst-case time. (Weiss, p. 119) space likely to run out? Why or why not? (Weiss p. 119)