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

i was actually wondering the same thing but i've tried and i don't think you can. i think once you set it up then that's what it stays as. sorry ; -;

no. when the asker posts the question they can make a question worth what ever they think is a fair price. although it must be within the limit of the points they currently own. 5 is the minimum number of points a question can be worth. if a question is complicated or has lots of parts to it, it is better to make it worth more because more people will be more willing to answer.

hope this !

i don't know to be honest but you on your own

step-by-step explanation:

ignitia made me retarted fool im stoopid laugh like shi

explanation:

no backup memory