Math 123 Homework 7 Problems 1. Consider the following graphs. Determine which ones have Euler paths or Euler circuits. Explain how you know without finding an Euler path or an Euler circuit. (c) 2. For all the graphs above that you identified as having an Euler path or Euler circuit, find one. 3. For the following graph, use brute force to find the best traveling salesman tour. (a) AC B 4. For the following graph find the nearest neighbor tour starting at A and the cheapest link tour. A $5 9 $4.4 E B -$5.2- $4.0 (b ) $6.0 $4.3 $5.1 $4.7 $5.8 $5.6 D