An algorithm performs $1,000,000$ characteristic instructions in time t for a problem of size n$.$ When the problem size is doubled, the algorithm needs time just a little $<17$t to finish. What is the likely complexity of this algorithm?

$$ Constant Time

$0($n$^4)$

$0($n$)$

$0(1)$

$0($n$^2)$