\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
A snowplow must clear snow from all the roads connecting four intersections \(A\), \(B\), \(C\), and \(D\). The distances in meters are shown in the graph below. The snowplow starts at the garage located at intersection \(A\) and must return to \(A\) at the end of the shift.
  1. Explain why an Eulerian circuit does not exist in this graph.
  2. Solve the Chinese Postman Problem to find the minimum distance the snowplow must travel to clear every road and return to \(A\).

Capture an image of your work. AI teacher feedback takes approximately 10 seconds.