(Use this information to answer questions 14 to 17): A large sporting goods store is placing an order for bicycles with its supplier. Four models can be ordered: The adult Open Trail, the adult Cityscape, the girl's Sea Sprite, and the boy's Trail Blazer. It is assumed that every bike ordered will be sold, and their profits, respectively, are 30, 25, 22, and 20. The LP model should maximize profit. There are several conditions that the store needs to worry about. One of these is space to hold the inventory. An adult's bike needs two feet, but a child's bike needs only one foot. The store has 500 feet of space. There are 1200 hours of assembly time available. The child's bike need 4 hours of assembly time; the Open Trail needs 5 hours and the Cityscape needs 6 hours. The store would like to place an order for at least 275 bikes. Following is the linear programming problem: Xi : the number of the adult Open Trail bike ordered Xy: the number of the adult Cityscape bike ordered X3: the number of the girl's Sea Sprite bike ordered X4: the mumber of the boy' Trail Blazer hike ordered max 30-X, +25 X2 + 22 - X3 +20 - X 2.X: +2-X2 + X3 + X: