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?