Question $6(3$ marks$)$

This question can be answered after studying Section $27\mathrm{.}4.$ It assesses the learning outcome:

Know about the limits of computation and their practical implications.

Consider the problem of deciding whether a given function $($in Python or some other programming language$)$ is recursive. Is this a computable problem, i$.$e$.$ a decidable problem? In other words, is there an algorithm that can decide for every function whether that function calls itself? Explain why or why not.