roblem 4 (10 pts) You have three water jugs of odd shapes and no markings: - Jug A has capacity 10 gallons and has 10 gallons of water in it. - Jug B has capacity 7 gallons and is empty. - Jug C has capacity 4 gallons and is empty. At each step, you may pour water from a jug i into a jug j until either jug i is empty or jug j is full. Trace through the breadth-first search algorithm to find the minimum number of steps needed to get 5 gallons in Jug A and 5 gallons in Jug B. Draw the breadth-first search tree, but do not draw a node if it is already exists in the tree. If all of the children of a node are already in the tree, simply put an ' X ' directly below that node. On the arrows from parent nodes to their children indicate the source jug and the destination jug. Follow the example done in class. PLEASE MAKE YOUR TREE DIAGRAM NEAT