Answer:
The second and the third one
Step-by-step explanation:
An Euler path, in a graph or multi graph, is a walk through the graph which uses every edge exactly once. An Euler circuit is an Euler path which starts and stops at the same vertex. Our goal is to find a quick way to check whether a graph (or multi graph) has an Euler path or circuit.
hope it helps
Cheating in 2019 the wave
Answer:
A. (6,0)
Step-by-step explanation:
4a- 5b = 24
Check each point to see if its is true
A. (6,0)
4(6) - 5(0) = 24
24 = 24
true
B. (-5, -2)
4(-5) -5(-2)= 24
-20 +10 = 24
-10 =24
False
C. (0,6)
4(0) -5(6) =24
-30 =24
False
D. (-2, -5)
4(-2) -5(-5)=24
-8+25=24
18=24
False