Farmer, wolf, cabbage, sheep is a famous river crossing puzzle. The puzzle goes like this, a farmer wants to move a wolf, cabbage and sheep across a river. The farmer has only a small boat that can sit himself and one passenger. The wolf will eat the sheep if the farmer is not around. The sheep will eat the cabbage if the farmer is not around. The puzzle can be treated as a graph search problem and be solved using either breadth first search or depth first search. THE QUESTION IS , IS THE GRAPH CONSTRUCTED BY THE GIVEN PROBLEM A BIPARTITE GRAPH(WHY OR WHY NOT). EXPLAIN