Correct choice is (d) Ackermann function
The best I can explain: A primitive recursive function is one in which the upper bound or the number of iterations to be performed is known. Most computable functions studied in number theory are primitive recursive. These include addition, subtraction, multiplication, etc. Sequential logic, traversal filter, recursive filter, bit manipulation, and data packing are common primitive recursive functions.