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.
First you have to find out how much one cost.
In order to do that you have to divide 3.60/6. You would get 6. That is how much one cost. Then you have to multiply 6*2 and you would 12. So the answer is $12. I hope this helps
Answer:
c for plato users;)
Step-by-step explanation:
1. statement: angles 1 and 2 are supplementary, reason: adjacent angles on a straight line are supplementary
2. reason: Vertical angles are congruent
3. reason: Parallel lines for supplementary interior angles on the same side as the transverse
4. statement:angles 1 and 5 are equal reason:If two angles are supplementary to the same angle, they are congruent
