The director of an art museum is planning to send out an exhibit to three area schools. She wants to minimize travel time. The exhibit must travel to each of the three schools once on a particular day and return to the museum after visiting each of the three schools. The travel times, in minutes, between the schools and between the museum and the schools is given in the graph. School A 36 22 School B 25 Museum 45 49 24 School C Q Find the optimal solution, starting and ending at the Museum, using the Brute Force method. minutes of travel time Find an approximation of the optimal solution, starting and ending at the Museum, using the Nearest Neighbor method. minutes of travel time