(a) Explain the main ideas behind the Big-Oh notion of g(n) = O(f(n)). (b) Prove O(log_2(n)) = O(log_e (n)) step by step, given log_a n = log_b n/log_b a. (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 int i, j, Sum; 3 Sum = 0; 4 for (i = 0; i