Let f(n)= 32n*+ 12 n² log n. Then f(n)= O(?), f(n)= Q(?), f(n)=0 (?) Replace question marks with the correct answer (we look for the tightest bound once possible). Choose ONLY one case from the following six answers below: a) f(n)= O(n*), f(n)= Q(n²), 0 is not applicable here b) f(n)= O(n*), f(n)= Q(n*), (n)=0 (n*)

How do I do (K+1)? Please use step by step simply please

Which among the following is the recursive definition of Factorial , i.e., n! ? f(0) = 1, f(n) = (n)f(n – 1), where n E Z andn 2 1. %D f(0) = 1, f (n) = (n + 1)f(n – 1), where n E Z and n > 1. f(0) = 0, f(n) = (n)f(n – 1), where n E Z and n > 1. %3D f (0) = 0, f(n) = (n + 1)f(n – 1), where n E Z and n 2 1.

Given code. my main concern is where to place the given variables for the solution. please use code attached