A meter reader wants to read the meter at each house in the three-block neighborhood pictured. He plans to park his truck at one of the street intersections and walk to each of the houses. All of the streets have houses on both sides, and he needs to travel down each street twice (once for each side). Draw a graph corresponding to the walking route he needs to cover. Determine whether or not the graph has an Eulerian circuit, and if so, give one. If it does not explain why not.