WHICH OF THE FOLLOWING ALGORITHM WILL SOLVE THE PROBLEM CORRECTLY?

CoNSIDER AN element eij in matrix. Iterate and swap in bottom$-$up way until the next element in sequence is $>=$ eij $$Repeat until no further swaps are possible.

$1.$ Merge$-$sort on array created from all elements of matrix. Store the result in bottom up order.

$2.$ Sort each coloumn. Then sort each row. Return the matrix.

$3.$ Divide the matrix into four quadrants: the top$-$left, top$-$right, bottom$-$left and bottom right.top left quadrant consists of the intersection of the firt$[$n$/2]$ columns and $[$n$/2]$ rows, while the top right quadrant is the intersection of the first$[$n$/2]$ columns and math$[$n$/2]$ rows. the other two quadrants are defined similarly. Recursively sort each quadrant independently and return the matrix that is thus obtained. The base case is when n$=1,$ where you return the sorted matrix