There are three containers: a 10 liter container, a 7 liter container, and a 4 liter container. The 7 and4 liter containers are initially full of water, while the 10 liter container is empty. There is only one operation: pour the contents of one container into the other stopping only when the pouring container is empty or the receiving container is full.

Is there a sequence of pourings that leaves exactly 2 liters in the 4 liter container?

Model this as a graph problem:Define the graph.What is the problem that needs to be solved?

What algorithm can be used to solve this problem?