Which of the following is true of vertex-edge graphs All edges must be used once in a Euler path
Each one of them has a solution

Vertices may be used more then once Hamilton circuits

They can model real world problems

i got 86 for this

hope this !

if you need an explanation just ask

x=17

step-by-step explanation:

solve 3x-24=x+10

then that makes it 2x=34 because you subtract an x from both sides to get rid of the one on the right, and then you add 24 to both sides to get rid of the 24 on the left

divide by both sides by 2 to get your answer so that you can get your answer

option 2 is correct.

step-by-step explanation:

we are given two inequality equation

x+y> 5 and -3x+2y< -2

first we draw the graph of both function using t-table method

equation: x+y> 5

for x=0, y=5

for x=-5, y=0

table:

x   :   0     5

y   :   5     0

test point (0,0) , 0> 5

false

equation: -3x+2y< -2

for x=0, y=-1

for x=2, y=4

table:

x   :   0     2

y   : -1       4

test point (0,0) , 0< -2

true

now we draw the graph. see the attachment for graph.

common region would be solution set.

option 2 is correct.