Please use C++

Please work on following initial statement. No head file needed.

2. Problem Sim'eon Denis Poisson (1781-1840), a famous French mathematician and physicist, is said to have become interested in mathematics after encountering some version of the following old puzzle Given an 8-gallon jug full of water and two empty jugs of 5- and 3-gallon capacity, get exactly 4 gallon of water in one of the jugs by completely filling up and/or emptying jugs into others. Solve this puzzle by using breadth-first search. We will generalize this problem to work with 3 jugs of varying capacity. Let's say that we have 3 jugs, namely A, B, and C. Jug C will always start out completely full. Furthermore, we will define a goal state where jug A will contain a gallons, B will contain b gallons, and C will contain c gallons upon completion of the search. You need to use breadth-first search to find the minimum number of moves to go from the initial state to the goal state. The order in which you choose to pour the water from one jug to another will affect the order in your final solution. Therefore, to ensure your program produces the same result as that expected by the autograder, you must traverse the search space in the following order: 1) Pour from C to A 2) Pour from B to A 3) Pour from C toB 4) Pour from A to B 5) Pour from B to C 6) Pour from A to C 2. Problem Sim'eon Denis Poisson (1781-1840), a famous French mathematician and physicist, is said to have become interested in mathematics after encountering some version of the following old puzzle Given an 8-gallon jug full of water and two empty jugs of 5- and 3-gallon capacity, get exactly 4 gallon of water in one of the jugs by completely filling up and/or emptying jugs into others. Solve this puzzle by using breadth-first search. We will generalize this problem to work with 3 jugs of varying capacity. Let's say that we have 3 jugs, namely A, B, and C. Jug C will always start out completely full. Furthermore, we will define a goal state where jug A will contain a gallons, B will contain b gallons, and C will contain c gallons upon completion of the search. You need to use breadth-first search to find the minimum number of moves to go from the initial state to the goal state. The order in which you choose to pour the water from one jug to another will affect the order in your final solution. Therefore, to ensure your program produces the same result as that expected by the autograder, you must traverse the search space in the following order: 1) Pour from C to A 2) Pour from B to A 3) Pour from C toB 4) Pour from A to B 5) Pour from B to C 6) Pour from A to C