JAVA

3. Ackermann's function is a recursive mathematical algorithm that can be used to test how well a computer performs recursion (It is also important mathematically as well, as it is the first known function that is totally computable but not primitive recursive!). Write a method Ackermann(int m, int n), which solves Ackermann's function. The function is given by the following: If m = 0 If m > 0 and n = 0 n+1 -1, 1) A(m 1, AGm,n -1)) if m > 0 and n> 0 Note when testing this method keep m and n small, as A(4,2) is an integer of 19,729 digitis