An algorithm takes $0\mathrm{.}5$ ms for input size $100.$ How long will

it take for input size $500$ if the running time is the following

$($assume low$-$order terms are neglible$)?$

a$.$ linear

b$.\backslash$Theta $($n log n$)($Weiss says O$($n log n$),$ but he means $\backslash$Theta $($n log n$).$

See my September $13$ lecture notes on big O$.)$

c$.$ quadratic

d$.$ cubic