Problem $2(10$ points each$)$ Suppose an algorithm solves a problem of input size n in at most the number of steps listed for each T$($n$)$ given below. Calculate the Big$-($not just Big$-$O$)$ for each T$($n$).$ Show your work, including values for c and no$.(3)$ T$($n$)=$ n$4+2$n$2+$ nlogn $(4)$ T$($n$)=$ log$(5$ x $2")(5)$ T$($n$)=3$n$\_$logn