Q2. [25] For a given algorithm below, Algorithm Loop2(n): (0) $40 forit 1 to n do (11) for it 1 to i do (iii) se 8+2j 1) (A) [5] Count the number of primitive operations in each statement, (0) - (iii), of the algorithm and (B) (5) get the total number of primitive operations executed in the algorithm Assume that the variables i and jare incremented after the statement (iii) automatically, ignoring their hidden increment statements, See the Handout 2. 2) [5] Give the smallest asymptotic upper bound of the running time in 1.B)in Big-Oh notation in terms of n. c.g.) O(n), O(n), etc. 3) [10] Prove your answer in 2) by the definition of big-Oh. i.e. You have to find the positive constant c and no that satisfies the condition of the big-Oh definition. See the examples in the slides #22 - #26 and Handout 3