$5$ points An algorithm takes $1ms$ for input size $1000.$ How large can an input size be

if a problem can be solved in $1$ minute $($assuming that low$-$order terms are negligible$)$ if

the running time is:

$($a$)$ linear

$($b$)O(nlogn)$

$($c$)$ quadratic

$($d$)$ cubic

$($e$)$ exponential