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.
Subtracting mx from both sides, we get y-mx=b
You can go to the app Photomath if you want the step of the explanation
The answer is w⁻²/v⁻².
v/w raised to the second power is (v/w)²
(v/w)² = v²/w²
Since xᵃ = 1/x⁻ᵃ, then v²/w² = 1/v⁻²w²
Since 1/xᵃ = x⁻ᵃ, then 1/v⁻²w² = w⁻²/v⁻²
Answer:

Step-by-step explanation:
See comment for complete question.
Given


Required
Determine the amount allotted to each
From the question, we understand that each project gets each allocation.
So, the amount of each is:



<em>Each project gets £1121</em>