Goes through every edge exactly one; starts and stops at different places. a Hamiltonian Path b Hamiltonian Circuit c Euler Path d Euler Circuit

D. Euler Circuit.

Step-by-step explanation:

An Euler Circuit goes through every edge exactly once; starts and stops at the same vertex.

According to the Euler's Theorem, A graph has an Euler path if there are two 2-degree vertices without odd degrees and all other vertices have even degrees.

Mathematically, it is given as;

V+F=2-E

where;

F is the number of faces

V the number of vertices

E the number of edges.

72 is the answer to this problem

an

y = 6x -3y -12

y +3y +12 = 6x

=> . x = { 2y / 3 +2 } this is equation of line in terms of x

=> . if line meets the x-axis the co-ordinates of meeting point would be ( x , 0 )

=> . x = 2 ( 0 ) / 3 + 2

=> . x = 2

so, the point is ( 2 , 0 )