Suppose your program takes $1$ ms to solve a problem of size $100.$ What is the maximum problem size that can be solved in $100$s if the running time is as follows $(12\%)$:

a$.T(n)=lo{g}_{10}n$

b$.T(n)=5\sqrt[\phantom{2}]{n}$

c$.,T(n)=2n\sqrt[\phantom{2}]{n}$