Question 1 122 Performance Analysis 1 marks 6 marks) (a) Explain the main ideas behind the Big Oh notion of g(n) O(f(m)). (b) Prove O(log2(n)) O(loge (n)) step by step, given logan [6 marks] ogba (c) Consider a procedure in c pseudo code. The procedure takes two inputs. One input is a matrix M which has n columns and n rows in total. The other input is the value of n. i 1 int Count (int MI J 1, int n) 2 int i r j, Sum Sum 0; 4 for i 0; i n; it for (j 2 i, j n 1, j++) Sum 7 (i) a function g(a) based on number of basic steps compute procedure relating to the value of n in the worst-case analysis. You need to give details how you 18 marks) come up with the function g(n) step-by-step. 12 marks) (i) Show its time complexity in Big-Oh Question 1 122 Performance Analysis 1 marks 6 marks) (a) Explain the main ideas behind the Big Oh notion of g(n) O(f(m)). (b) Prove O(log2(n)) O(loge (n)) step by step, given logan [6 marks] ogba (c) Consider a procedure in c pseudo code. The procedure takes two inputs. One input is a matrix M which has n columns and n rows in total. The other input is the value of n. i 1 int Count (int MI J 1, int n) 2 int i r j, Sum Sum 0; 4 for i 0; i n; it for (j 2 i, j n 1, j++) Sum 7 (i) a function g(a) based on number of basic steps compute procedure relating to the value of n in the worst-case analysis. You need to give details how you 18 marks) come up with the function g(n) step-by-step. 12 marks) (i) Show its time complexity in Big-Oh