1. Suppose that you have two algorithms, algorithm Aj and A2. (20 points) Ai has T(n) n2-2n Ag has T2(n) = 20n Using limits, show the Big O Ai and A2 which are both of polynomial complexity. Show Ai is O(n2) and that A2 is O(n) (a) In ori equal to each other and solve] (c)What happens when the problem increases past the bound you found in part (b)? (d) Find T1(10) and T (30) (e) Find T2(10) and T2(30)