Answer:
26
Step-by-step explanation:
The objective function is;

The vertices of the feasible region are (0,4), (4,2) and (5,0) and (0,0)'
We substitute the vertices into the objective function to get;
At (0,4);

At (0,4);

At (5,0);

At (0,0);

Therefore the maximum value is 26
Answer:
-90 is the answer
Step-by-step explanation:
hope it helpss <3
Answer:
0.165
Step-by-step explanation:
so i just divied 18 into 2.97
i dont know how right this is
Answer:

Step-by-step explanation:
3 envelopes having 2 red card
2 envelopes having 1 red card and 1 black card
1 envelope having 2 black cards
We are given that . An envelope is selected at random and a card is withdrawn and found to be red.
So, No. of ways of envelope having red card = 3+2 = 5
No. of required ways of envelope having 1 red card and 1 black card = 2
So, probability of getting an envelope having 1 red card and 1 black card = 
Hence The chance the other card is black is 
If you round the answer is about 11 bags a day