Answer:
first one is not. parallel second one is not and the third one is
Answer:
(4,5)
Step-by-step explanation:
The "feasible region" has vertices (0,0), (7,0), (5,4), and (4,5)
P = 5x + 6y
Plug in each vertices in P and find out which give maximum value
(0,0) => P= 5(0) + 6(0) = 0
(7,0) => P= 5(7) + 6(0) = 35
(5,4) => P= 5(5) + 6(4) = 49
(4,5) => P= 5(4) + 6(5) = 50
We got maximum P=50 for vertex (4,5)
So the coordinates of the point that has the maximum value is (4,5)
•First you multiply parentheses by 3 24+3n-15=24
•then u cancel equal terms 3n-15=0
•Move the constant to the right
3n-15=0
3n=15
•Divide both sides by 3
Answer is n=5 ☺️
Answer:
C
Step-by-step explanation:
8*5=40 minutes
There is a total of 60 minutes.
So:
40/60 = 4/6 = 2/3