(1-a) Provide one point for and against Turing Test to determine if a software piece is intelligent

For questions (1-b) and (1-c), answer if forward search (data driven search) or backward search (goal driven search) will be more appropriate with one good reason for the scenarios given:

(1-b) You have met a person Dr. Rajiv who claims to be your distant cousin. You need to verify his claim by finding some common ancestor who is a few generations older. (1-c) A system that will help human to classify plants by species

For questions (1-d) and (1-e) consider the following scenario:

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 rivers 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.

(1-e) Which of DFS or BFS is most preferred for this problem? Why.