NOTE: CODE IN PYTHON

Task 1 Generate and print a random 5 x 5 jumping maze, where there is a legal move (jump) from each non-goal state. Task 2 Randomly choose the start node and the goal node. Task 3 Draw the directed graph (with clear arrows showing the direction) on a A4 paper for the randomly generated 5 x 5 maze in the previous step, also showing the start and the goal node. Task 4 Compute and print the shortest path and the length of that path from the start node to the goal node. Task 5 Finally compute the length of shortest path from the start node to all other nodes and print where each cell contains the length of shortest path (start node contains 0)