a java program

Exercise 8.4 The goal of this exercise is to translate a recursive denition into a Java method. The Ackermann function is dened for non-negative integers as follows:

A(m,n) =

n + 1 if m = 0

A(m1,1) if m > 0 and n = 0

A(m1,A(m,n1)) if m > 0 and n > 0

Write a recursive method called ack that takes two ints as parameters and that computes and returns the value of the Ackermann function.

Test your implementation of Ackermann by invoking it from main and displaying the return value. Note the return value gets very big very quickly. You should try it only for small values of m and n (not bigger than 3).