artificial intelligence

tas Problem A farmer, wolf, sheep and grass are initially on one side of the river (A). The farmer wants to transport everything to the other side (B) under some conditions: He can only transport a maximum of one thing each time (in addition to himself because he is the only one that can drive the boat) ii. The sheep cannot be left alone with the wolf or grass at any side. Transportation in both directions is allowed, le, A to B and B to A. We would like to formulate this as a search problem. a) Choose a suitable state representation. Describe the possible values it can take (Hint: you can use binary representation) b) How many world states in this problem (including those that are not allowed)? c) Using your notation in tel. give two examples of states that are not allowed due to condition (i). c) Using your notation in (al. blve one example of an action (state transitions) that is not allowed due to condition (). c) Using your natation in (a), write the start state and the goal state, cs Scanned with CamScanner