\( \definecolor{colordef}{RGB}{249,49,84} \definecolor{colorprop}{RGB}{18,102,241} \)
A park ranger needs to inspect every path in a park shown by the graph below. The lengths of the paths are given in meters. The ranger starts at the entrance \(E\) and must return to \(E\).
  1. Explain why it is impossible to traverse every path exactly once and return to \(E\).
  2. Solve the Chinese Postman Problem to find the minimum distance the ranger must travel.

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