A given program runs in $0\mathrm{.}1sec$ for inputs of size $N=1000.$ We have deduced that the time

complexity of the program is of the form a $N^2,$ where $a$ is some constant. How large instances can

the program handle within $2$ minutes?.