A farmer with his wolf, goat, and cabbage come to the edge of a river they wish to cross. There is a boat at the river$$s edge, but, of

course, only the farmer can row. The boat also can carry only two things $($including the rower$)$ at a time. If the wolf is ever left alone

with the goat, the wolf will eat the goat; similarly, if the goat is left alone with the cabbage, the goat will eat the cabbage. Devise a

sequence of crossings of the river so that all four characters arrive safely on the other side of the river.

$(1-$d$)$ Devise a concise representation of a state $($considering all possible uses of this in search algorithms taught to you$).$ As per the

representation devised provide write down the representation of a start state and the goal state.