C++ Data Structures Course about Recursion

(a) Give a detailed trace of the call F(5), showing all recursive calls and, for each call, the parameters passed and the value returned. int F (int n, int a = 0, int b = 1){ if (n == 0) return a: else return F (n - 1, b, a + b): } (b) Explain what the recursive F() function calculates. Indicate what kind of recursion it realizes and the benefits of this implementation