Hi i have few questions that i wanted to quickly confirm with (python)

i thought that 2^n is greater than n^3 in the way that it grows rapidly, so wouldnt the anaswer be A? or is because of the 100 infront of n^2

can someone explain quickly how to do this one

and the steps to do this one!

cheers

Question 9 [2 marks] Suppose Algorithm A has time requirement of 100n'+18n2+89n+628 and Algorithm B has time requirement of 2+3n2+2. Which of the following statements is FALSE? (a) Algorithm A has better performance than Algorithm B when n is very large (e.g. n>100) (b) Big-O performance for Algorithm A is O(n3) (c) Algorithm B has better performance than Algorithm A when n is very large (e.g. n>100 (d) Big-O performance for Algorithm B is O(2") (e) None of the above