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

Write a program that inserts the digits of an integer into an array in originalorderfollowed by reverse order. first, promptthe user to enter a positive integer(> 0). determine the number of digits of the integer. create a dynamically allocated integer arrayof a size twice the number of digits.now insert the digits in original order which will occupy half of the array. then, insert the digits in reverse order.finally, output thedigits in thearray.use at least two functions to organize your program.