Answer:
16 because 3×4 =12 and 16-12 is 4 so 4×3
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.
2x^2-5x-3
This is the answer I believe, I apologize if it’s incorrect
20 • 12 is 240
1/2 • 12 • 4 is 24
so 264
