Suppose that for solving the same problem with size n$,$ algorithm A uses f$($n$)=$ n$^2$ log n$+2$n $+10$

operations, and algorithm B uses g$($n$)=100$ n $+15$ n log n $+100$

operations. Which algorithm runs fast when n is large enough?

Question $17$ options:

algorithm A

algorithm B