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.
It will be the last one a×b×b
Answer:
x=-25/4
Step-by-step explanation:
First your make both sides clean,
x+4=-9/4
Then you minus 4 on both sides to balance the equation:
x+4-4=(-9/4)-4
x= -25/4
72 people stayed, because 96 ÷ 4 = 24, and 24 * 3 is 72.
Answer:
volume of sphere=4/3 π4³=256/3π ft²
