BrainyJanie88
contestada

Giselle enjoys playing chess and Scrabble. She wants to play a total of at least 10 games (condition A), but she has only 6 hours 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?

Giselle enjoys playing chess and Scrabble She wants to play a total of at least 10 games condition A but she has only 6 hours to do it condition B The graph rep class=
Giselle enjoys playing chess and Scrabble She wants to play a total of at least 10 games condition A but she has only 6 hours to do it condition B The graph rep class=

Respuesta :

kevinartiles33

Answer:

She only can play at most 4 chess games

HowardChickenAmber

Answer: She can play 4 chess games at most.

Step-by-step explanation: You can see that the lines intersect at (6,4), in which the y-coordinate (chess games) is 4.

Otras preguntas