Problem-1: A farmer needs to cross a river with his fox, goose, and a bag of corn. There's a rowboat that will hold the farmer and one other passenger. The problem is that the fox will eat the goose, if they are left alone, and the goose will eat the corn, if they are left alone. Define states pace, operators, initial and goal states and draw the search tree (using either BFS or DFS). Problem-2: Suppose we want to travel by train to the Armadillo Convention in El Paso, and we want to find the least expensive ticket from Madison using BFS and DFS and compare the cost and give your comments on these searching techniques. Madison $48 $15 Denver S48 Kansas $18 St. Louis $27 City Nashville $36 $16 $42 Phoenix Baton $21 El Paso S48 $14 Rouge $12 Houston In python