Q1) Consider the following optimization problem (P1). maximizesubjectto3x1+8x2+9x3+4x4+12x5+11x6+20x7+17x86x1+12x2+21x3+11x4+16x525016x5+23x6+12x7+18x815010x1+22x2+18x31469x1+2x2+5x32108x1+17x2+6x312018x6+20x7+11x822121x6+12x7+7x832317x4+22x522312x4+21x522211x4+7x5123x1,x2,x3,x4,x5,x6,x7,x80andinteger. a.) Identify a bordered block-diagonal structure in the constraint matrix of this problem by visual inspection. Clearly indicate the border component and the subproblem blocks. Then, solve this optimization problem via DantzigWolfe reformulation using the block-diagonal structure identified above. At each iteration, write down clearly your master problem and subproblems. No need to do all the iterations, you can stop after three iterations