A farmer has to cross a river with his fox, goose and grain. Each trip, his boat can only carry himself and one of his possessions. How can he cross the river if an unguarded fox eats the goose and an unguarded goose eats the grain. 1. Perform Depth-first search to solve this problem (see code/function format below) 2. Perform Breadth-first search to solve this problem (see code/function format below)

Write the codes using python programming language.

Can you please explain and show me how to implement the graph, start_node ,end_node and How to solve these (1.-perform DFS, 2-perform BFS) using the code format shown below?

1.- For Depth first search algorithm

DFS(graph, start_node, end_node): frontier = new Stack() frontier.push(start_node) explored = new Set() while frontier is not empty: current_node = frontier.pop() if current_node in explored: continue if current_node == end_node: return success for neighbor in graph.get_neigbhors(current_node): frontier.push(neighbor) explored.add(current_node)

2.- For Breadth-First Search Algorithm BFS(graph, start_node, end_node): frontier = new Queue()

frontier.enqueue(start_node) explored = new Set() while frontier is not empty: current_node = frontier.dequeue() if current_node in explored: continue if current_node == end_node: return success for neighbor in graph.get_neigbhors(current_node): frontier.enqueue(neighbor) explored.add(current_node)

([Fa Fo Go Gr|]) ([Fo Gr|Fa Go]) ([Fa Fo Gr|Go]) ([Fo|Fa Go Gr]) ([Fa Fo Go Gr|]) ([Fo Gr|Fa Go]) ([Fa Fo Gr|Go]) ([Gr|Fa Fo Go]) ([Fo|Fa Go Gr]) ([Fa Go Gr|Fo]) ([Fa Fo Go|Gr]) ([Go|Fa Fo Gr]) ([Go|Fa Fo Gr]) \begin{tabular}{|c|} \hline ([Fa Go|Fo Gr]) \\ \hline ([|Fa Fo Go Gr]) \\ \hline \end{tabular} ([Fa Fo Go|Gr]) ([Fa Go|Fo Gr]) ([Fa Go Gr|Fo] )