Q2: (5+5=10 Marks) a) While solving CSPs problems, how backtracking search can be more efficient by add assignment filtering and ordering techniques? Explain your answer with an example? b) You have given robot navigation problem. You have to apply A* search algorithm. Manhattan distance can be used as heuristic action. A robot can move up, down, left and right. Robot Starting position and goal position is given in grid. Shaded region are hurdles and you cannot move to that block. Cost of each action is given below: UP: 1. Down: 1. Left: 3 and Right: 2 S G Q2: (5+5=10 Marks) a) While solving CSPs problems, how backtracking search can be more efficient by add assignment filtering and ordering techniques? Explain your answer with an example? b) You have given robot navigation problem. You have to apply A* search algorithm. Manhattan distance can be used as heuristic action. A robot can move up, down, left and right. Robot Starting position and goal position is given in grid. Shaded region are hurdles and you cannot move to that block. Cost of each action is given below: UP: 1. Down: 1. Left: 3 and Right: 2 S G