5. The graph below has exactly two vertices of odd degree, namely A and B. Eulerize this graph to find the most efficient path that starts and ends at the same vertex and traverses each edge at least once. A B