An O$($n$^2)$ algorithm takes about $0\mathrm{.}3$ seconds to process $10,000$ numbers. Assuming that lower$-$order terms are insignificant, approximately how long will it take to process $50,000$ numbers?

$($a$)$

$1\mathrm{.}5$ seconds

$($b$)$

$3$ seconds

$($c$)$

$7\mathrm{.}5$ seconds

$($d$)$

$9$ seconds

$($e$)$

$30$ seconds