Explain in detail, step by step, how the shortest path algorithm would be executed on the graph below, starting at vertex d. Do only the first 2 repetitions of the main loop. 4

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?

3. Given the graph below. Illustrate Dijkstra algorithm to find the shortest path from vertex s as the source. G 10 15 2 2 5 d

Please make a graph by hand for each step. no code