The passcode to a game must contain 2 letters and 3 digits. How many codes are available if the 2 letters must be different and the 3 digits can be repeated?

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!

graph them on a graphing calculator, press 2nd trace. select intersect. hit enter until it says answer. ti 84 works best

step-by-step explanation:

idk

step-by-step explanation:

there are no multiple choices