A) Algorithm A uses 4n*log n +3n operations, while algorithm B uses n^2 operations. Determine the value n0 such that A is better than B for n n0.

B) Are there values of n such that B is better than A? If yes, list the ranges. If not, justify why not.

C) Determine the value n0 such that A is better than B for n n0, when B uses n^3 operations.