Answer:
I think it might be B. but I am not so sure.
The answer is 52 if you get the manager special
Commutitive Property of Multiplication
Hope I'm the brainliest!
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.
F/3+36=c subtract 36 from both sides
f/3=c-36 multiply both sides by 3
f=3c-108