We have three containers whose sizes are 10 pints, 7 pints, and 4 pints, respectively. the 7-pint and 4-pint containers start out full of water, but the 10-pint container is initially empty. we are allowed one type of operation: pouring the contents of one container into another, stopping only when the source container is empty or the destination container is full. we want to know if there is a sequence of pourings that leaves exactly 2 pints in the 7- or 4-pint container. (a) model this as a graph problem: give a precise definition of the graph involved and state the specific question about this graph that needs to be answered. (b) what algorithm should be applied to solve the problem? (c) find the answer by applying the algorithm.