Artificial intelligence

Production rules for the water-ug problem Rule Current state New state Rules 1 (x. y) ifxc4 (x, y) ify 3 (x, y) if x>0 (x. y) fyo (x, y) if x>0 (x, y) ify o (x. y) if (xty4 (4.y) Fill the 4-gallon jug. (x.3) Fill the 3-gallon jug. (x-d, y) Pour some water out of (x. y-d) Pour some water out of (0. y Empty the 4-gallon jug (x, 0) Empty the 3-gallon jug (4y-14-x)) Pour water from 3- 4-gallon jug. 3-gallon jug. on ground. on ground. gallon jug into the 4- gallon jug until the 4- gallon jug is full. if(x+y)>-3 &(x 0) (x-(3-y),3) Pour water from 4- gallon jug into the 3 gallon jug until the 3- gallon jug is full. (x. y) if (xty4 &yoo) (x, y) if (xty3 &(x -0) (xty,0) Pour all the water from 3-gallon jug into the 4- gallon jug. Pour all the water from 4-gallon jug into the 3- gallon jug. Pour the 2 gallons from the 3-gallon jug into 4-gallon jug. Empty 2 gallons in the 4-gallon jug on the 10 (0,xty) 11 (0.2) (2.0) 12 (2.y) (0.y) a) Draw the state space search tree b) BFS and DFS trees. c) Write with execution (using SWI-Prolog) the required prolog program