You are given $2$ algorithms A$1$ and A$2$ that solve the same problem. Their running times are

T$1($n$)=$ n$310$n$2+1000,$ T$2($n$)=$ n $+1000$

For which input sizes is A$1$ faster than A$2?$ Consider both small and very large inputs. $($Justify

your answer.$)$