Problem 2 -- Highly Recursive Function

Professor Plums likes recursion, but his students typically find it confusing. During a recent faculty meeting his mind wandered, and he invented the following recursive mathematical function, H(n): - H(n) = H(n+4) + H(n+2) for all value of n < -5 - H(n) = n*2 for all value of -5 $\leq$ n $\lt$ 2 - H(n) = H(n-8) - H(n-4) + H(n-3) for all values of n $\geq$ 2. He wants you to write a pr