Please read everything. This is a Java problem. Thank you

Considering the following recursive definition:

Acker(m, n) = n + 1, if m = 0;

Acker(m, n) = Acker(m - 1, 1), if n = 0;

Acker(m, n) = Acker(m 1, Acker(m, n 1)), otherwise.

This function is called Akermanns function

It grows rapidly with respect to the sizes of m and n.

Write a Java program to find Acker(1, 2).

Can you find Acker(1, 2) without using a computer?