python

Part1 [20 marks]: A robot is constrained to move in the given 2D grid and not hitting the obstacles/barriers (i.e., black cells). Use the Grassfire algorithm and find all the shortest paths that the robot could take to go from the START node (Green) to the GOAL node (Red). You need to do this part by hand and identify all the possible path solutions