Please help with all 3 if possible!

3. (2 points) Describe how to implement a stack ADT using two queues. What is the running time of the push ), and pop () function in this case? (Goodrich p. 224) which returns the smallest element in the data structure, all in 0(1) worst-case time. (Weiss, p. 119) space likely to run out? Why or why not? (Weiss p. 119) 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