What happens to the allowable size of the problem if we increase the speed of reading **tenfold**?
- In linear case, then for algorithm A with time complexity $n$ and
size $s_1$, the allowable size becomes $10s_1$.
- In quadratic case, then for algorithm B with time complexity $n^2$ and size $s_2$, the allowable size becomes $\sqrt{10}s_2 = 3.16s_2$.
- etc.
**Problem**: can you please show how that is the case that size of algorithm B increases to $\sqrt{10}s_2 = 3.16s_2$ if we increase reading speed by 10 fold?