Answer:
ques 1) Euler circuit
ques 2) start at vertex D and ends at B.
ques 3) AE
ques 4) A or B
ques 5) 200
Explanation:
Question 1)
The graph is a Euler circuit since in order to cover all the edges exactly once it start and ends at the same vertex.
Question 2)
To create a Euler path, we can start at Vertex D and end at vertex B.
and the path is given as:
DCFADBCEFGAB
Question 3)
To find the Minimal spanning tree using kruskal's Algorithm we can start with the edge AE.
As it has the least value i.e. 2.
Question 4)
A or B.
As The minimum cost in A and B is same which is 16.
Question 5)
When x=9 then y is given by:
y=20 x
i.e. y=20×9=180
Now for y>80 to be true we use the expression:
z=y+20=180+20=200
Hence z=200