Show that the function f(n) defined by
if (I) = 1
f(n) = f(n-1) + 1/n for n>1, has the complexity O (log n)
Let the size of the elements stored in an 8*3 matrix be 4 bytes each. If the base address of the matrix is 3500, then find the address of A [5,2] for both row major and column major cases.