Please assist with the problem in the given picture attached

Problem 100b) Consider the following 4 x 4 "max" Young tableau: 34 20 17 12 31 16 15 10 15 11 9 6 12 8 5 4 Fill in the table below to show the 4x4 "max" Young tableau that would result from uccessive removal (using the algorithm presented in class, in which "ties" are broken hoosing the horizontally adjacent -rather than the vertically adjacent- one of the by c two equal transposition candidates) of the largest three values from the above Young tableau. Remember that in a "max" Young tableau empty cells are assigned the value -oo C"negative infinity"), /lend