2. Professor Adirolf has developed a pair of mutually recursive functions unt the solve two related sets of problems. Answer the followin to co g questions about developing a memoized algorithm to compute the values to these functions. The functions satisfy the recurrences: 0 ifn=1 EG), if n>2 E(n)0, (a) Give a small example demonstrating why dynamic programming would be effective at solving this problem. You do not need to trace your ex- ample fully, just enough to demonstrate why dynamic programming is applicable. (b) What data structure(s) would you recommend for a dynamic pro- gramming solution to computing O(n) and E(n). Include the imple- mentation and size of the data structure(s) in your answer (c) Give pseudocode for a pair of memoized dynamic programming al- gorithms capable of computing O(n) and E(n), for any n2 1. Note that both O(n) and E(n) are nonnegative for all n 2