Q1: Using the definition of O, give a formal proof for: 0.5n3 4n2 + 2 (n). Q2: Give a formal proof for: f(n) O(91(n)) and h(n) (92(n)) = f(n) + h(n) E O(MAX(91(n), g(n))). Q3 (Q5, Section 2.3 in the Textbook): Order the following functions according to their order of growth (from the lowest to the highest): (n 2)!, 5 lg(n + 100)10, 221, 0.001n4, 3n3 +1, Inn, Yn, 3". Q4: What is the time complexity of the following algorithm? Find the operation count as a function of the input size and a tight O estimate (you don't need to give a formal proof for the O estimate). Algorithm 1: Y Algorithm Y Algorithm(A[O..n 1]) for i:=0.. ] -1 do for j:=i..n - 1 do A[j]:=A[j] + A[i]; end end