1. Write down the necessary and sufcient conditons for optimality for the problem. Minimize (x1 3)2 + (x2 D2 Subject to x3 + 311 2 Also set up the problem for exterior penalty approach. 2. Formulate the 0-1 programming problem for the six room and seven door art gallery problem shown. Solve using U-l approach for minimum number of guards to cover every room. (You may check your solution using computer.)