In this problem we will look at a special case of matrix multiplication. Assume n is a power of 2. Let A be any real n x n matrix. Let B be a n x n matrix where every element in the matrix is a fixed constant c. W I For example, when n = 2, for arbitrary w, x, y, z, and c, A = and B = y 2 (1) Describe a divide-and-conquer algorithm to compute C = A x B in O(n) time. (2) Write out the recurrence T(n) for your algorithm and prove that it is (n). C C C