What is the shortest Hamilton path in the vertex-edge graph below?

Answer:
A to C to D to B
Step-by-step explanation:
Pretend you are inside and you have 4 options and since almost everyone is lazy,they will try to go to the shortest way possible or else their late or something.