(a) Explain the main ideas behind the Big-Oh notion of g(n) = O(f(n)). (b) Prove O(log(n)) = O(log(n)) step by step, given logan log n [6 marks] [6 marks] (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. 1 int Count (int M[][], int n) { 2 3 4 5 6 7 } int i, j, sum; sum = 0; for (i=0; i < n; i++) for (j 2*i; j