Finding a path in the grid shown below from the position s to the position g. The robot can move on the grid horizontally and vertically, one square at a time (each step has a cost of one). No step may be made into a forbidden shaded area. The order of the operators you will test is: up, left, and right, then down. Draw the Search tree Finding a path in the graph shown above from the position S to the position G using DFS by PYTHON language and draw the tree of this graph Finding a path in the graph shown above from the position S to the position G using BFS by PYTHON language and draw the tree of this graph