Exercise I (15 points) Consider two algorithms A, and A2 that have the running times Ti(n) and T2(n), respectively. T(n) = Ti(n) = 100n2 + 100n and T2(n) = 0.1n2 + 0.1n a) (12 points) Use the definition of Ol) to show that Ti(n) E O(T2(n)). b) (3 points) Which algorithm should you use? A, or Az? Justify Exercise 2 (15 points) Consider two algorithms A, and A2 that have the running times Ti(n) and T2(n), respectively. T(n) = T1(n) = 100n2 + 100n and T2(n) = 0.1n2 + 0.1n a) (12 points) Use the definition of 12() to show that Ti(n) E (T2(n)). b) (3 points) Show that Ti(n) E (T2(n))