4. Consider the above LPP and answer the following questions. By solving Constraints 3, 4, 5, 6, 7, 8, 9, 10 and 11 as equality do we get a BFS2 5. Consider the same LPP. By solving Constraints 4, 5, 6, 7, 8, 9, 10, 11 and 12 as equality and by solving Constraint 1, 2, 3, 5, 6, 8, 10, 11 and 12 as equality, do we get adjacent pair of BFS. Questions 4, and 5 are based on the following LPP. Maximize z = 5x-3x + 2x3-4x4-4x5 + 726-5x, - xy + xg x + 2x3 + 2x + 3x51x6 + 2xy + 4x, 5 3x + 4x-x3 + x4 + 2x5-2x6 + 1x + 3xg 9 -x2x + 4x4 x5 + 2x6 + 3x + 2xg+x9 3 x 0 Constraint 1. Constraint 2. Constraint 3. Constraint 4. Constraint 5. Constraint 6. Constraint 7. Constraint 8. Constraint 9. Constraint 10. Constraint 11. Constraint 12. X 20 X3 0 X4 0 X, 20 X6 20 x, 20 Xa 0 X, 20