Create a class named Ackermann.

Create a static method named ackermann which takes $2$ int parameters, m and n$.$ Use recursive logic to calculate a value as follows:

Ackermann$(0,$ n$)=$ n $+1$

Ackermann$($m$,0)=$ Ackermann$($m $-1,1)$

Ackermann$($m$,$ n$)=$ Ackermann$($m $-1,$ Ackermann$($m$,$ n $-1))$