Let us say we have two functions that represent the time taken for program execution of two different programs.

$T_1(n)=n^{299}+n^2$

$T_2(n)=n^{300}+nlogn$

Which of the following statements is$/$are true about the two programs? Assume $n$ is the size of input.

Select all that apply:

The order of growth of $T_1$ is lesser than the order of growth of $T_2$

The function $T_1$ will take less time to execute than $T_2$ for same inputs to both functions for large inputs

The function $T_2$ will take less time to execute than $T_1$ for same inputs to both functions for large inputs

The order of growth of $T_1$ is greater than the order of growth of $T_2$

$T_2(n)inO(n^{300})$

Both $T_1$ and $T_2$ will grow at the same rate asymptotically

$T_1(n)inO(n^{300})$