In a given representation for a real symmetric positive-definite NxN matrix C, express it in the form
C = S + K,
where S is a diagonal positive-definite matrix of rank N, and K is a semipositive-definite matrix of the _smallest_ possible rank M < N. Do the solutions for S and K exist? If yes, are they unique? If yes, outline an algorithm to find S and K.