Answer:
x - 99 ≤ -104 → 2nd line
x - 51 ≤ -43 → 1st line
150 + x ≤ 144 → 4th line
75 < 69 - x → 3rd line
Step-by-step explanation:
Ugh! Wow, this is going to be tedious, thanks alot, bro (jk, I got your back).
x - 99 ≤ -104
+ 99 + 99
x ≤ -5
There should be a line going from -5 to negative infinity (AKA the left) with a FILLED circle. So, the second one is correct.
x - 51 ≤ -43
+ 51 + 51
x ≤ 8
There should be an arrow with a FILLED circle going to negative infinity (AKA the left). So, the first one is correct.
I'm going to take a shortcut and notice that one of the lines has a filled circle while the other one has an empty circle. So the empty circle must relate to the question without a ≤ or ≥, but with a < or >. We see that 75 < 69 doesn't have ≤ or ≥ but a '<.' So this one must have the empty circle, which is on line 3. The last equation has to be on line 4.
11x° is interior angle of ladder to the ground
and 7X° is interior angle of ladder to the wall
exterior angle of a ladder to wall is 180-7x
and exterior angle of a ladder to ground is 180-11x
Well, "minus 6 x cubed minus y squared minus 3 x y" translates to:

Then, if we insert the values for x and y, we get:

When we distribute and multiply:

And once we combine like terms:
104<em> is the answer</em>
Answer: 
Step-by-step explanation:
Here the total numbers are 1, 4, 3, 7, 6
Since the total number of possible arrangement =
The total number of the odd numbers in the given numbers = 3
Thus the possible arrangement that the first three digits will be odd numbers = 
Thus, the probability that the first three digits of Irvings ID number will be odd numbers = the possible arrangement that the first three digits will be odd numbers / total possible arrangement =
= 
Hi there! The answer would be:
y=-2/5x+2.
Explanation:
We can start by plotting the given point (-5,3). From there, we can use the slope to place other points to find the y intercept. Using the slope of the graph, we can find that the line segment hits (2,0). Therefore, how answer would be: y=-2/5x+2
Hope this helps!!! :DD
mark brainliest if possible! If not, that’s okay!