a) Write a pseudo-code that computes the above sum given the k*k coefficient matrix C with entries c_ij, And find the number of operations (only arithmetic and logical) that your algorithm performs in the worst case.

b) Assume now that the coefficients c_ij are not given to you but have to be calculated for each i.j using an algorithm that requires O(k³) steps. Give a big-O estimate for computing the sum under this assumption (you don't have to write the pseudo-code but explain all details).

Many useful calculations in probability and physics require us to perform certain weighted sums related to pairs of integers (ij). Consider the following sum: 2-12-1621 =1(2i+j) cij Assume that the coefficients cij (for all i, j, i=1,2....k, j=1,2....k) are given to you as inputs as the entries of a matrix C