Suppose T1(n),,T6(n) are functions describing the runtime of six algorithms. Furthermore, suppose we have the following bounds on each function: T1(n)=(n3)T2(n)=O(nlogn)T3(n)=(logn)T4(n)=O(n4)andT4=(n2)T5(n)=(n)T6(n)=(nlogn)T7(n)=O(n1.5logn)andT7=(nlogn) What are the best bounds that can be placed on the following functions? For this problem, you do not need to show work. Hint: watch the supplemental lecture at Example: T1(n)+T2(n) Solution: T1(n)+T2(n) is (n3). a) T1(n)+T5(n) b) T2(n)+T6(n) c) T4(n)+T5(n) d) T7(n)+T4(n) e) T3(n)+T1(n) f) T1(n)T4(n)