Given the following maximum problem: Given the following maximum problem: Maximize: P = x1 - x2+ x3 Subject to the following constraints: Maximize: P = 2x1 + 3x2+ 4x3 2x1 + x2 - 3x3 5 40 Subject to the following constraints: x1 + x3 5 25 2x2 + 3x3 5 32 X120 x1 + 2x2 5 12 X2 20 x1 + x3 5 8 x3 20 x120 x2 20 the Initial Simplex Tableau can be formatted in this form: x320 P x1 X2 x3 $1 $2 53 RHS all a12 a13 a14 a15 a16 a17 a18 a21 a22 423 424 a25 426 427 428 the Initial Simplex Tableau can be formatted in this form: a31 432 433 434 a35 a36 437 438 P X1 x2 x3 $2 RHS 041 042 043 044 045 046 947 048 all a12 a13 a14 a15 a16 a17 In each box below, enter the appropriate value that must replace each of the letters all a21 a22 a23 a24 a25 a26 427 through a48 in the above tableau. a1= a31 432 a33 a34 435 436 a37 a12= In each box below, enter the appropriate value that must replace each of the letters all through a37 in the above tableau. 413= 014= 015= a12= 416= a13= @18 = 414 = 21 = a15= 422 = 416 = 423 = 424 = a17 = Q25 = 421 = 426= Q27 = a22 = 428 = 423 = 431 = a24 = 432 = 433 = a25 = 434 = 426= 035 = 436 = a27= 037 = 431 = 438 = Q41= a32 = Q42 = a33 = 043= a34= Q44= 045 = a35 = Q46= a36= 047 = a48 = a37=