A) You have given robot navigation problems. You must apply BFS, Uniform Cost Search and A* search algorithm. Mention your queue status, Visited node and path in each algorithm separately. Manhattan distance can be used as a heuristic function. A robot can move up, down, left, and right. Robot Starting position and goal position is given in grid. Cost of each action is given below: UP: 1, Down: 3, Left: 3 and Right: 2 Initial State: S
Goal State: G