Let f(n)= 32n⁴+ 12 n² log n . Then f(n)= O (?), f(n)= (?), f(n)= (?)

Replace question marks with the correct answer (we look for the tightest bound once possible). Choose the correct case from the following options:

a. f(n)= O(n⁴), f(n)= (n⁴), f(n)= (n⁴)

b. f(n)= O(n⁴), f(n)= (n² log n ²), is not applicable

c. None of the cases are correct.

d. f(n)= O(log n), f(n)= (log n), f(n)= (log n)

e. f(n)= O(n²), f(n)= (n²), f(n)= (n²)

f. f(n)= O(n² log n), f(n)= (n² log n), f(n)= (n² log n)

g. f(n)= O(n⁴), f(n)= (n²), is not applicable