Giselle enjoys playing chess and Scrabble. She wants to play a total of at least 10 games (condition A), but she has only 6 hour
s to do it (condition B)
The graph represents the constraints on the number of chess games C and Scrabble games S Giselle plays.
What is the greatest number of chess games Giselle can play while meeting both constraints?
The graph represents the constraints on the number of chess games C and Scrabble games S Giselle plays.
What is the greatest number of chess games Giselle can play while meeting both constraints?
1 answer:
You might be interested in
Answer:
Step-by-step explanation:
Since, the surface area of a cylinder,
................(1)
Where,
r = radius,
h = height,
If
( by middle term splitting )
By zero product property,
r = 3 or r = - 6 ( not possible )
Thus, radius, r = 3 meters,
Now, differentiating equation (1) with respect to t ( time ),
∵ h = constant, ⇒ dh/dt = 0,
We have,
Now,
Volume of a cylinder,
Differentiating w. r. t. t,