Formulate the following as a linear programming problem: a greenhouse operator plans to bid for the job of providing flowers for city parks. he will use tulips, daffodils, and flowering shrubs in three types of layouts. a type 1 layout uses 30 tulips, 20 daffodils, and 4 flowering shrubs. a type 2 layout uses 10 tulips, 40 daffodils, and 3 flowering shrubs. a type 3 layout uses 20 tulips, 50 daffodils, and 2 flowering shrubs. the net profit is $50 for each type 1 layout, $30 for each type 2 layout, and $60 for each type 3 layout. he has 1,000 tulips, 800 daffodils, and 100 flowering shrubs. how many layouts of each type should be used to yield maximum profit?

An attorney came to work on a saturday. when he signed in, he was advised by the morning security guard employed by the building management that he must be out of the building by 5 p.m., when it closes. however, he stayed past 5 p.m. to complete a brief that had to be filed on monday morning. at 5: 15 p.m., the afternoon security guard set the locks on all the doors of the building and left. because she was in a hurry, she did not check the sign-in sheet to make sure that everyone had signed out, contrary to mandatory procedures. when the attorney tried to exit 15 minutes later, he discovered that the doors were all locked and could not be opened from the inside. he used his cell phone to call for , and a supervisor from the building arrived and let him out shortly thereafter. if the attorney sues the building management for false imprisonment, is he likely to win?