Ackermann's Function
Ackermann's Funcation is a recursive mathematics algorithm that can be used to test how well a computer performs recursion. Design a function ackermann (m, n), which solves Ackermann's Function in python. Use the following logic in your function:
If m = 0 then return n + 1
If n = 0 then return ackermann(m - 1, 1)
Otherwise, return ackermann(m - 1,ackermann(m, n - 1))