// 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:

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.