If there are two algorithms for processing input data of size $10$k records. Algorithm A takes $0\mathrm{.}0001$n$2,$ algorithm B takes $10*$n$*$log$10$ n$,$ what is the smallest value of k that makes algorithm B better than algorithm A

Select one:

a$.10$

b$.6$

c$.12$

d$.5$