(15 points) Consider the following computational problem: Given two length-n arrays R and C, either find an n n boolean array such that the number of true entries in each row i (resp., column j) is equal to R[i] (resp., C[j]), or report (correctly) that no such array exists. Design and analyze a polynomial-time algorithm for this problem. Hint: Use a greedy approach