1.=9900
2.=9.3
3.= x= 12.2155
Hope this helps
a. Only a Hamiltonian path
One such path is
1 → 2 → 0 → 4 → 3
which satisfies the requirement that each vertex is visited exactly once.
There is no Hamiltonian circuit, however, since it is impossible for any Hamiltonian path on this graph to visit vertex 0 exactly once.
Answer:
x = 130
Step-by-step explanation:
Sum of all the angle of quadrilateral = 360°
50 + 45 + 35 + ∠ADC = 360
130 + ∠ADC = 360
∠ADC = 360 - 130
∠ADC = 230
x = Reflex ∠ADC
= 360 - 230
= 130
A = 1/2 bh
A = 1/2 (21)(8)
A = 1/2 (168)
A = 84
Answer:
3 times 8 = 24 + 8 = 32
Step-by-step explanation:
