Question 3: The functions f : N N, g : N2 N, and h : N N are recursively defined as follows: f(n) g(m, 0) g(m, n) h(0) h(n) g(n, h(n)) 0 g(m, n-1) + m 1, 2h(n-1) if n 2 0, if m 2 0, if rn > 0 and n = 1, = = ifr121. = Solve these recurrences for, i.e., express f(n) in terms of n