Describe these simple algorithms in english please thanks!

Question 8: Let m > 1 and n > 1 be integers and consider an m n matrix A. The rows of this matrix are numbered 1, 2,... , m, and its columns are numbered 1,2,... , n. Each entry of A stores one number and, for each row, all numbers in this row are pairwise distinct. For each i-1,2,... , m, define g(i) = the position (i.e., column nuinber) of the smallest number, in row z We say that the matrix A is awesome, if g(1) g(2) K g(3) S g(m) In the matrix below, the smallest number in each row is in boldface. For this example, we have m 4, n-10, 1(1) = 3, g(2) = 3, g(3) 5, and g(4) 8. Thus, this matrix is awesome dface. For this example, we 13 12 5 8 6 915 20 19 7 3 4 1 17 6 13 710 2 5 19 5 12 7 2 4 11 13 6 3 7 4 17 105 14 12 3 20 6 From now on, we assume that the m x n matrix A is awesome Let i be an integer with 1