Help please Artificial intelligence

29 You have two bucket) and empty (E) a bucket (onto the ground G or into another bucket). The goal state is to have 1 liter of water in bucket A. Draw a search tree showing a sequence of tasks for reaching the goal state assuming you start with both A and B empty. Each task should have the form XYZ where X-(F,E), Y={ A,B) and Z={ A,B,G,H) You have two buckets, A which holds 3 liters and B which holds 4 liters operations you can perform: fill (F) a bucket from a hose (H) (or another