Suppose that integers are given m<n. Consider a spreadsheet of size n×n, whose cells arbitrarily record all integers from 1 to n2. Each row of the table is colored in yellow m the largest elements. Similarly, the blue colors the m of the largest elements in each column. Find the smallest number of cells that are colored yellow and blue at a time combinatoricsColoringminmax