will leave a thumbs up for correctr work and explanation

the below: Given the following source code where n= number of data points: It is found the cost function of the code is: T(n)=c0(100n+1)+c1(100n)(50n+1)+c2100n50n. Reducing and collecting produces: T(n)=c0100n+c0+cl5000n2+cl100n+c25000n2 T(n)=c0+c0100n+cl100n+cl5000n2+c25000n2 T(n)=(c0+c0100+cl100)n+(cl5000+c25000)n2 Replacing the const ant terms with the values c3=c0+c0100+cl100 and c4=cl5000+c25000. Produces: T(n)=4n2+c3n Determine which is true: For any c3,c4>0 is it true T (n) (n2) as n>. For any c3,c4>0 is it true T (n) (n2) as n>. For any c3,c4>0 is it true T(n)O(n2) as n>. Show all logic and work using the inequality proof tests: i.e. for f(n)O(g(n)) show that f(n)0 as n>