Computer Science 5. How would you modify the dynamic programming algorithm for the coin- collecting problem if some cells on the board are inaccessible for the robot? Apply your algorithm to the board below, where the inaccessible cells are shown by X's. How many optimal paths are there for this board? 2 3 4 5 6 1 X 2 3 O 4 5XXX can you please write this in pseudocode using robotcoin algorithm? O O XIX X X O O O

You are organizing a programming competition, where contestants implement Dijkstra's algorithm. Given adirected graph G = (V, E) with integer-weight edges and a starting vertex s ∈ V , their programs are supposedto output triplets (v, v.d, v.π) for each vertex v ∈ V . Design an O(V +E) time algorithm that takes as inputthe original graph G in both adjacency matrix (G.M) and adjacency list (G.Adj) representations, startingvertex s, and the output of a contestant's program (given as an array A of triplets), and returns whetherA is the correct output for G. Write down the pseudocode for your algorithm, explain why it correctlyveries the output, and analyze your algorithm's running time. You may assume that all edge weights of the input graph provided to the contestantsare nonnegative and A (the output of their programs) is in the valid format, i.e., you don't need to verifythat A is actually an array of triplets, with v and v.π being valid vertices and v.d being an integer.Can you…

There are many applications of Shortest Path Algorithm. Consider the problem of solving a jumbled Rubik's Cube in the fewest number of moves. I claim that this problem can be solved using a Shortest Path Algorithm. Determine whether this statement is TRUE or FALSE. NOTE: if you want to check if this statement is TRUE, think about how the Rubik's Cube Problem can be represented as a graph. What are the vertices? Which pairs of vertices are connected with edges? What is your source vertex and what is your destination vertex? How would Dijkstra's Algorithm enable you to find the optimal sequence of moves to solve a jumbled cube in the fewest number of moves?

Suppose that you have a maze search problem. From each numbered square in the maze, youmay move that exact number of squares horizontally or vertically in a straight line. Startingat a particular square (e.g. the top-left corner), find a path to the goal square marked "G".3 4 1 3 1 3 3 3 G 2 3 1 2 2 3 4 2 3 3 3 4 1 4 3 2 Describe the State Space components of this problem. Then solve the problem using breadthirst search and the depth first search. Hint: Indicate the changes to the Open and ClosedQueues in solving this problem for each type of search.