Answer the following: The Galloper function g is defined recursively by: g(0) = 1, g(1) = 2 g(n) = 4g (n - 2) + g(n - 1) where n > 1. Find g(2), g(3) and g(4). Is the set of integers generated by g(n) a countable set? Explain why or why not? Write a recursive algorithm for computing where in a acceleration integral, as defined in the above question. Using mathematical induction prove that g(n) 1. Find g(2), g(3) and g(4). Is the set of integers generated by g(n) a countable set? Explain why or why not? Write a recursive algorithm for computing where in a acceleration integral, as defined in the above question. Using mathematical induction prove that g(n)