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.
No.

If you add them up you DO NOT GET
According to mathematics, it equals to
.
Check the picture below, that's the "inscribed angle theorem"
Answer:

Step-by-step explanation:
Given

Required
Determine the equation for the model
Represent the number of hours with h and the miles with m.
Using distance formula:

In this case, it is:

So, we have:

