Ackerman's number, used in mathematical logic, can be calculated using the formula shown in Exercise 6. Write a recursive C function that calculates Ackerman's number. Verify your algorithm by using it to calculate the following test cases: Ackeran (5,2), Ackerman(2,5), Ackerman(0,3), and Ackerman(3,0).

You will need a main function and an Ackerman function. Output should be done in main or with a third function. The Ackerman function should only calculate the appropriate Ackerman value and then return the value. You only need to submit your .c file for this project. When testing do not try to calculate Ackerman (5,2) as it says in the text as that may cause overflow problems on some systems.