$[3$ points$]$ Algorithm A and B spend exactly $!()=0\mathrm{.}1"$ log #$ $$ and $\%()=2\mathrm{.}5"$

microseconds respectively, for a problem of size n$.$ Choose the algorithm, which is better in the Big$-$O

sense, and find out a problem size n $0$ such that for any larger size n $>$ n$0$ the chosen algorithm

outperforms the other. If your problems are of the size $<=10$& $,$ which algorithm, will you

recommend to use?