1. For a given Graph interface, and Unweighted Graph class, design a testing class to test the Unweighted Graph below. (25 points) 2. For a give Graph interface, and Unweighted Graph class, design a testing class to test DSF and BSF methods for the Unweighted Graph below, starting from Boston and Chicago. (25 points) Seattle (9) Boston (0) Chicago (4) Denver (5) New York (1) San Francisco (10) Kansas City (6) Los Angeles (11) Dallas (7) Atlanta (2) Houston (8) Miami (3) 3. For the given Graph interface, Unweighted Graph class, and Weighted Graph class, design a testing class to test the Weighted Graph below. (25 points) For the given Graph interface, Unweighted Graph class, and Weighted Graph class, design a testing class to test MinimumSpanning Tree and Shortest Path methods for the Weighted Graph below, starting from Boston and Chicago. (25 points)

1. For a given Graph interface, and Unweighted Graph class, design a testing class to test the Unweighted Graph below. (25 points) 2. For a give Graph interface, and Unweighted Graph class, design a testing class to test DSF and BSF methods for the Unweighted Graph below, starting from Boston and Chicago. (25 points) Seattle (9) Boston (0) Chicago (4) Denver (5) New York (1) San Francisco (10) Kansas City (6) Los Angeles (11) Dallas (7) Atlanta (2) Houston (8) Miami (3) 3. For the given Graph interface, Unweighted Graph class, and Weighted Graph class, design a testing class to test the Weighted Graph below. (25 points) For the given Graph interface, Unweighted Graph class, and Weighted Graph class, design a testing class to test MinimumSpanning Tree and Shortest Path methods for the Weighted Graph below, starting from Boston and Chicago. (25 points)