QUESTION 8: TRUE/FALSE.For each of the statements below mark clearly whether it is TRUE or FALSE with a big x. STATEMENT TRUE FALSE = (n log n) if f(n)=0(g(n)) then g(n) = (f(n)) QuickSort is a comparison based sorting algorithm log(rd) = (n2) 2" = (3") If f(n) = (g(n)) then 2/(n) = (2g(n)) n = 0(n log n) (log n)2 (log n) log(n*) = (log n) 1000-6(10000n) I5