Calculating the Ackermann's function At the lectures we saw recursive functions. One of the most known recursive functions is Ackermann's function. In the basic form, this is a function of three arguments, but in the literature, we often use a derivative with two arguments: Péter and Robinson.     !!!!!!!!!!!!!!!!!!USING A PEN AND PAPER!!!!!!!!!!!!!!! Compute the a (3, 3), write the solution on a paper. Scan the paper and jpg files (each sheet into a separate file). Archive all files into the zip archive and submit this file as a solution to the task!

Using Python Recursion is the concept of a function calling itself until the problem is solved when the Base Case is met. Study Recursion: See slides in Modules, Practice Slides, lab12 and also Recursion is in chapter 9 of the textbook. Some examples of recursion are: compute [ factorial of a number, towers of Hanoi, fractals (as shown in the textbook), and many more]. Example: See slides Page 2 For this assignment we'll use Collatz Cojecture (see Wikipedia). Collatz Conjecture algorithm: Given a number n, first call to the function: f(n): In the function: if n == 1 return 1: if n is even then f(n/2), i.e. call self with the new value. else (n is odd) call self with the new value, f((n*3)+1) and repeat. All numbers eventually end up with 1. The program should test for the base case which is: if n == 1, in which case it returns to the caller with 1. This problem is perfect to demonstrate Recursion.Create a list with random numbers (you can just do this part manually) in the list as 1,…

Use ONLY PyCharm, please.Thank you.

A recursive sequence is defined by - d k = 6 d k − 1 + 3 , for all integers k ≥ 2 and d1 = 2 Use iteration to guess an explicit formula for the above sequence.