In C++

Write a function fact(n) that calculates factorial of n recursively. Example: fact(5) = 5*4*3*2*1 = 120. Note that fact(0) is defined to be 1, so that will be your base case. You may assume that the function is always called with a nonegative integer.

Prototype: int fact(int n);

You'll only need three to four lines of code in the function body.

The driver used to test your code is below:

int main(){ int n; cin >> n; cout << n << "! = " << fact(n) << endl; return 0; }