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
Answer:
The answer is option 3.
Step-by-step explanation:
In order to solve the inequality, you have to get rid of -3 by adding 3 to both sides :



Multiply the equations by 2 and then subtitude,