Exercise $3$: Ackermann Function

The Ackermann function has particular significance in computability theory. The values of $A(m,n)$ grow very, very quickly.

Write the recursive code that corresponds to this function $($ not there are $2$ base cases and one general case$).$ Now run your program on $A(0,0),A(1,1),A(2,2).$