In this question, that deals wih siple unconstrained minimization, we want to explore if specifying a restricted domain can make a function convex. Define a function f:S1R by f(x)=(x12)2(x21)2 with domain S1={xR2suchthat0x11,x22x1}. 1. Sketch S1. 2. Write a series of linear constraints which define S1. 3. Show or explain that S1 is convex. 4. Determine if f:S1R is convex or not. In this question, that deals wih siple unconstrained minimization, we want to explore if specifying a restricted domain can make a function convex. Define a function f:S1R by f(x)=(x12)2(x21)2 with domain S1={xR2suchthat0x11,x22x1}. 1. Sketch S1. 2. Write a series of linear constraints which define S1. 3. Show or explain that S1 is convex. 4. Determine if f:S1R is convex or not