algorithm a has the running time f$($n$)=400$ log n and algorithm b has the running time g$($n$)=2^$n for what input sizes is a better than b$?$ for what input sizes hsould we use.b instead of a