Suppose a $1$X computer can run n instructions in time t$.$ A $2$X computer can run $2$n instructions in time t$,$ etc. How much time would a quadratic complexity algorithm run on a $2$X computer for a problem size n$?$

$$ n$^2/$ t$^2$

$(2$t$)/$n

$$ n$!/(2$n$)!$

$0$n$/2$t