Question

1. Suppose that a night watchman must patrol the neighborhood shown below, walking on each side of each block at least once, starting at his home H and ending at Deb's Diner D for breakfast. Find an optimal (e.g. the shortest possible) route for the watchman to take, numbering the streets 1, 2, 3, ... in the order in which he is to walk them. (Note: You must first draw an equivalent "pure" graph to model the situation.) (10 points) (Yes, the watchman must walk all the way around the park.)