Let f(n)= 32n4+ 12 n log n . Then f(n)= O (?), f(n)= Q (?), 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: None of the cases are correct. f(n)= O(n4), f(n)= Q(n log n), is not applicable f(n)= O(n4), f(n)= Q(n4), f(n)= 0(n) f(n)= O(n log n), f(n)= Q(n log n), f(n)= 0 (n log n) f(n)= O(n^), f(n)= Q(n), is not applicable f(n)= O(n), f(n)= Q(n), f(n)= O(n) Of(n)= O(log n), f(n)= Q(log n), f(n)= (log n)