3. A notoriously known secretive company is deciding on producing three new devices code- named A, B, and C. The company assumes it can sell these products in unlimited quantities (yes, we will be buying them :)) at the following unit prices: A $100, B $560, and C $1000. Producing a unit of A requires 1 hour of labor, a unit of B requires 2 hours of labor and 2 units of A, and a unit of C requires 3 hours of labor and 1 unit of B. Any A that produces B cannot be sold, and any B that produces C cannot be sold. A total of 40000 hours of labor are available. Formulate an LP to maximize company's profit. 5. Apply the Simplex Algorithm using Tucker tableau to the following LP problem. Use x1 as the first entering variable. Maximize: f(x1, x2, x3) = 3x1 + 2x2 + 4x3 subject to x1 + x2 + 2x3 4 2x1 + 3x3 5 2x1 x23x3 7 x1, x2, x30