Mark the statements as true or False

A. If a function f(n) is O(g(n)), then there is some n0 such that f(n)g(n) for all nn0.

B. Intuitively, the Big-O of a function can be thought of as a lower bound

C. If a function is O(n) then it is also O(nlog(n)).

D. O(10*n*n^3 + 1023 * log(n) * n^3) - O(n^4)

E. O(sqrt(n^5)) O(n^2)