If A is an m x n matrix of rank r, then a rank factorization of A is an equation of the form A = CR, where C is an m x r matrix of rank r and R is an r x n matrix of rank r. Show that such a factorization always exists. Then show that given any two m x n matrices A and B. rank(A + B) ≤ rank A + rank B