To demonstrate that computer scientists can turn just about anything into a graph problem, let's consider the difficult problem of stirring up a batch of pancakes. The recipe is really quite simple: 1 egg, 1 cup of pancake mix, 1 tablespoon oil, and 3/4 cup of milk. To make pancakes you must heat the griddle, mix all the ingredients together and spoon the mix onto a hot griddle. When the pancakes start to bubble you turn them over and let them cook until they are golden brown on the bottom. Before you eat your pancakes, you should heat up some syrup. This process is depicted by the graph below. 3/4 cup milk heat griddle 1 egg 1 cup mix pour 1/4 cup urn when bubbly 1 Tbl Oil heat syrup eat To help us define the order for each of the steps required to make our pancakes, run the topological sorting algorithm that we saw in classroom. Draw the sequence of steps and show they preserve the dependency restrictions depicted in the graph