Consider the function f .n. defined as follows, where n is a nonnegative integer:

Consider the function f .n. defined as follows, where n is a nonnegative integer:

For each of the following values of n, draw the recursion tree and calculate the value of f .n..

(a) n = 1.

(b) n = 2.

(c) n = 3.

(d) n = 4.

(e) n = 5.

(f) n = 6.