Consider the following piece of pseudocode: 1: function FACTORIAL(n) 2: if n=0 then 3: return 1 4: end if 5: return n x FACTORIAL(n) 6: end function This function is supposed to return the factorial of a non-negative integer n. The factorial is the product of all integers from 1 to n, and is equal to 1 for n equal to 0. For which of the following reasons will it not do this correctly? There is only one correct answer. i. The base case is incorrect ii. The function does not return anything for all arguments n iii. There will be infinite recursion for n not equal to 0 iv. The function will not return anything for n equal to 0