A game is played with a deck of 50 cards numbered from 1 to 50. At the end of each round, players calculate their score by adding the numbers on their cards. What is the least score a player could have if he or she has 7 cards remaining at the end of a round? points

`1234567890-=/*-qwertyuiop[]asdfghjkl; '\\zxcvbnm,./+ /

no ,sorry if you needed it but you can ask and try to see if any one will anwser ,

step-by-step explanation:

by good luck mark me as brainliest

have a nice day

i think it is 18

step-by-step explanation:

so firstly, we need to isolate the y variables to be able to solve these inequalities. firstly, add 0.5x on both sides of the first inequality and subtract 1.5x on both sides of the second inequality:

now since the slope is positive for the first inequality, this means that the line going upwards belongs to the first inequality, and the line going downwards belongs to the second inequality.

next, since y ≥ in the first inequality, this means that the shaded region will be above the first inequality's line, thus shading regions a and b.

next, since y ≤ in the second inequality, this means that the shaded region is going to be below this line, thus shading regions a and c.

since both lines shade region a, this means that region a is the solution.

step-by-step explanation:

mark brainliest!