A. State the size of the input in big-Oh. For example, if the input to an algorithm is an array of size k, then the input size is n O(k).

B. Derive the cost function for the algorithm.

C. State the complexity of the algorithm in Big-Oh. The complexity MUST be stated in terms of input-size.

D. Prove that the derived cost function is in the stated order (big-Oh).

input: M[k] [k] A matrix (2D array) of size k x k output: Mx V Rarray[k] / new array of size n for j =... k Vk / A vector (1D array) of size k for i - 0 k return R