// n is a non-negative integer

function f(n) if n == 0 || n == 1 return 1; else return n*f(n-1);

Respond to the following:

What does the f function do? Please provide a detailed response.

In terms of n, how many computational steps are performed by the f function? Justify your response. Note: One computational step is considered one operation: one assignment, one comparison, et cetera. For example, the execution of 3*3 may be considered one computational step: one multiplication operation.

What is the Big-O (worst-case) time complexity of the f function in terms of n? Justify your response.

Define a recurrence relation a_n, which is the number of multiplications executed on the last line of the function f, "return n*f(n-1);", for any given input n. Hint: To get started, first determine a₁, a₂, a₃ . From this sequence, identify the recurrence relation and remember to note the initial conditions.