please in urgent 30 min sir/mam

Riverbank A RIVER Riverbank B Figure: Wolf, chicken and a bag of grain (A) The above figure shows a problem of a farmer, wolf, chicken and a bag of grain. The goal is to bring all the 3 things (wolf, chicken and a bag of grain) from Riverbank A to Riverbank B. But there are few constraints which are: i. the farmer must always be in the boat so that he can steer it ii. the wolf cannot be left alone with chicken because it will eat the chicken iii. the chicken cannot be left alone with the bag of grain because it will eat the grain iv. the farmer can only bring 1 thing at a time to cross the river (because the boat is small) Rules are: R1: Farmer brings chicken from Riverbank A to Riverbank B and leave the chicken R2: Farmer brings chicken from Riverbank B to Riverbank A and leave the chicken R3: Farmer cross the river alone R4: Farmer brings wolf from Riverbank A to Riverbank B and leave the wolf R5: Farmer brings wolf from Riverbank B to Riverbank A and leave the wolf R6: Farmer brings bag of grain from Riverbank A to Riverbank B and leave the grain R7: Farmer brings bag of grain from Riverbank B to Riverbank A and leave the grain You are required to determine what is the sequence of rules need to be executed such that eventually the farmer can bring the wolf, chicken and grain (from Riverbank A) to Riverbank B. The sequence of the rules are: Ist is to use Rule 2nd is to use Rule 3rd is to use Rule 4th is to use Rule 5th is to use Rule 6th is to use Rule 7th is to use Rule (B) Given the following production set: RI. FACAA Goal R2. A-C R3.BE R4. CAB-D R5. EAD-F R6. Start - AAB You are required to use data driven approach (begin with Start) to reach the Goal. Fill in the following table for each iteration. Iteration-1 Working Memory: Start Conflict Set: R6 Rule Fired: R6 Iteration-2 Working Memory: Start, Conflict Set (B) Given the following production set: RI. FACAA Goal R2 A-C R3. BE R4.CABD R5. E ADF R6. Start - AAB You are required to use data driven approach (begin with Start) to reach the Goal. Fill in the following table for each iteration. Iteration-1 Working Memory: Start Conflict Set R6 Rule Fired: R6 Iteration-2 Working Memory: Start, Conflict Set: Rule Fired: Iteration - 3 Working Memory: Start, Conflict Set: Rule Fired: Iteration-Final Working Memory: Start, A, B, C, D, E, F, Goal Conflict Set: HALT Rule Fired: - How many iterations does it take to reach the Goal