We have three containers, whose sizes are 10 pints, 7 pints, and 4 pints. The 7-pint and 4-pint containers are full of water, while the 10-pint container is empty. We are only allowed one operation: pouring the contents on one container into another, stopping only when the source container is empty, or the destination container is empty. Determine if there is a sequence of pourings that leave exactly 2 pints in the 7- or 4-pint container. Model this as a graph problem. Try solving the general version where there are three containers of integer capacities of a maximum of n. The starting configuration is provided, and we have some desired "end state". Determine if the "end state" can be achieved. Give pseudocode and work out the running time. We have three containers, whose sizes are 10 pints, 7 pints, and 4 pints. The 7-pint and 4-pint containers are full of water, while the 10-pint container is empty. We are only allowed one operation: pouring the contents on one container into another, stopping only when the source container is empty, or the destination container is empty. Determine if there is a sequence of pourings that leave exactly 2 pints in the 7- or 4-pint container. Model this as a graph problem. Try solving the general version where there are three containers of integer capacities of a maximum of n. The starting configuration is provided, and we have some desired "end state". Determine if the "end state" can be achieved. Give pseudocode and work out the running time