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

Select one:

a$.6$

b$.12$

c$.10$

d$.5$