QUESTION 8 (20 points): TRUE/FALSE. For each of the statements below mark clearly whether it is TRUE or FALSE with a big X STATEMENT TRUE FALSE n-(n log n) if f(n) O(g(n)) then g(n) (f(n)) QuickSort is a comparison based sorting algorithm log(n!) = (n2) If f(n)= (g(n)) then 29(n) 2f(n) = ( ) n = 0(n log n) (log n)-(log n) log (n*)-(log n) -= (10000m)