Consider four programs$-$A$,$ B$,$ C$,$ and D$-$that have the following performances:

A: $O(logn)$

B: $O(n)$

$C$:$O(n^2)$

$D$:$O(2^n)$

If each program requires $10$ seconds to solve a problem of size $1000,$ estimate the time

required by each program when the size of its problem increases to $2000.$

$($Hint: Program A requires time $T(n)$~~kxlogn $)$