Model the following problem into a graph coloring problem: A local zoo wants to take visitors on animal feeding tours, and is considering the following tours: Tour 1 visits the monkeys, birds, and deer; Tour 2 visits the elephants, deer and giraffes; Tour 3 visits the birds, reptiles and bears; Tour 4 visits the kangaroos, monkeys and bears; Tour 5 visits birds, kangaroos and pandas; If the animals should not get fed more than once a day, can these tours be scheduled using only Monday, Wednesday and Friday? To answer this, model the following problem into a graph coloring problem and complete parts (i) and (ii) (i) Draw a graph G with vertices as tours. What are the edges? What do the colors mean? (ii) GRAPH: Show an assignment of the days for each of the tours.