Algorithm

Please answer number 10 clearly

Thanks

We define a "max" Young tableau to be a Young tableau in which the entries are in descending order from left to right in each row and in descending order from top to bottom in each column. Fill in the table below to create the 4 times 4 "max" Young tableau that would result from consecutive insertion (using the algorithm presented in class) of the following sequence of values into an initially empty 4 times 4 tableau. Recall that in a "max" Young tableau, empty cells are assigned the value -infinity ("negative infinity"). 6, 22, 31, 27, 12, 32, 8, 10, 14, 11, 23, 30, 29, 15, 16, 28 Consider the following 4 times 4 "max" Young tableau: Fill in the table below to show the 4 times 4 "max" Young tableau that would result from successive removal (using the algorithm presented in class) of the largest three values from the above Young tableau. Remember that in a "max" Young tableau empty cells are assigned the value -infinity ("negative infinity"). We define a "max" Young tableau to be a Young tableau in which the entries are in descending order from left to right in each row and in descending order from top to bottom in each column. Fill in the table below to create the 4 times 4 "max" Young tableau that would result from consecutive insertion (using the algorithm presented in class) of the following sequence of values into an initially empty 4 times 4 tableau. Recall that in a "max" Young tableau, empty cells are assigned the value -infinity ("negative infinity"). 6, 22, 31, 27, 12, 32, 8, 10, 14, 11, 23, 30, 29, 15, 16, 28 Consider the following 4 times 4 "max" Young tableau: Fill in the table below to show the 4 times 4 "max" Young tableau that would result from successive removal (using the algorithm presented in class) of the largest three values from the above Young tableau. Remember that in a "max" Young tableau empty cells are assigned the value -infinity ("negative infinity")