A Young tableaux is an _N-by-_N matrix such that the entries are sorted both column wise and row wise. Prove that Theta(_N²log _N) compares are necessary to sort the _N² entries (where you can access the data only through the pairwise comparisons).