Given the optimization model below, answer the following questions: min (=30x1-2z+252-0.52 subject to 321+672=300 2x+4x21 58-28 What are the decision variables? What is the objective function? What are the constraints? 21.0 6. (10 points) Convert the following linear programming model to a general form LP in matrix notation. min (=3x+52 +63 subject to 21+2+235 21+2+6738 -5x-6x+334 115 2256 10 7. (Bonus: 0.10 points) Note that, 0A 0 and 40 0, where 0 is a matrix containing all zeros. Provide two matrices A and B of size (2 x 2) that contain no zeros such that AB=0.