6-3 Young tableaus An m x n Young tableau is an m x n matrix such that the entries of each row are in sorted order from left to right and the entries of each column are in sorted order from top to bottom. Some of the entries of a Young tableau may be oo, which we treat as nonexistent elements. Thus, a Young tableau can be used to hold r S mn finite numbers. a. Draw a 4x4 Young tableau containing the elements 9, 16, 3, 2,4, 8,5, 14, 12) b. Argue that an m x n Young tableau Y is empty if Y[1, oo. Argue that Y is full (contains mn elements) if YLm,n] oo