Is it possible to find a path through the house that uses each doorway once? If so, enter the sequence of rooms (vertices) visited, for example ABCDA.

region b will make the inequalities y < 2x + 1 and y > -x - 2 true ⇒ answer a

step-by-step explanation:

* lets study the graph and the inequality to solve the question

- the inequality y > -x - 2

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = -2 that means the line intersect the y-axis at point (0 , -2)

∵ the sign of the inequality is >

∴ we shad the part over the line

  region a and b

- the inequality y < 2x + 1

∵ the form of the inequality is y > mx + c , m is the slope of the line

  and c is the y-intercept (the line intersect y-axis at point (0 , c)

∴ c = 1 that means the line intersect the y-axis at point (0 , 1)

∵ the sign of the inequality is <

∴ we shad the part under the line

  region b and c

∵ the common region between the two lines is region b

∴ region b will make the inequalities y < 2x + 1 and y > -x - 2 true

this is a good question! i’ll do some research and what i find, i’ll contact you asap when i have something! ✊

a and c

for infinitely many solutions we require both left and right sides to be equal

distribute and simplify

a

14 - 8x = 20 - 8x - 6 = 14 - 8x ← both sides equal so infinite solutions

b

6x - 54 = 6x - 54 + x = 7x - 54 ← not equal

c

4x + 16 = 4x + 10 + 6 = 4x + 16 ← both sides equal so infinite solutions

d

5x - 40 + 10 = 5x + 10

5x - 30 = 5x + 10 ← not equal