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$)=$log$10$n b$.$ T$($n$)=5$n c$.$ T$($n$)=2$n$$n