The algorithm A has a worst-case running time T(n) = 2n-3 1) Is T(n)- O(n2) Explain your answer. T(n)- O(n2) is 2) is T(n) = 0(2")? Explain your answer. 3) Is T(n) = 0(n!)? Explain your