Question $5)$ Fill the following CPU time table:

$\backslash$table$[[$Algorithm$,$Running Time $T(n),\backslash$table$[[$Max input size $n,$ when$],[$the available time we$],[$have is $1000$ seconds$]],\backslash$table$[[$Max input size $n,$ when$],[$the available time we$],[$have is $1000$ seconds,$],[$and our CPU is $2000],[$times faster$]]],[$A$1,T(n)=150n,,],[$A$2,T(n)=3n^2,,],[$A$3,T(n)=100n^2,,],[$A$4,T(n)=n^3,,],[$A$5,T(n)=100n^3,,]]$

Based on the numbers you see in the table, which algorithm is using the CPU resources better than others? Why?