Consider the following transportation problem, transporting a product from three sources (S) to four destinations (D). Source S1 S2 S3 Demand D 1 $10/unit 11 9 10 D2 10 4 16 15 D 3 5 12 24 35 D4 8 22 15 20 x11+x12 +x13 + x14 15 (source one supply constraints x21 + x22 + x23 + x24 30 (source two supply constraints x31 + x32 + x33 + x14 35 (source three supply constraints 1) Please formulate this problem as LP model and solve it using LINDO. The objective function is to minimize total shipping cost while satisfying the supplies and demands. Supply 15 30 35 2) Please explain your shipping schedule based on the of part 1). 3) Please solve this problem using the transportation simplex algorithm.