The answer is c. The problem can be solved graphically
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.
Answer:
...
Step-by-step explanation:
since they give us the side opposite of the given angle(Opposite) and we are trying to find for a (Adjacent/side), so we use TOA
tan(30)= 
i see u dont want it solved but ill solve it anyways
since a is on the bottom then lets switch them

x= 6.928
Answer:
The answer would be A and D, I just took the quiz
Step-by-step explanation: