please finish question a

3a You are implementing a game in which a player attempts to escape from a maze. The maze exists within a M x N grid, has one exit, and is defined by a set of connections. From their current location the player can move horizontally or vertically to a neighbouring point, but only if a connection exists to that point. So, only if a connection [[1,2], [1,3]] is part of the maze's definition, is it possible to take a step between points [1,2] and [1,3] in either direction. i) An escape route is a way to reach the exit in the fewest steps. Starting with the list C = [G, . . .,Ck] of connections and the location [ex, ey] of the exit, describe the operations you would perform before the game is played so that an escape route from any point [x, yl can be obtained during the game within (s) time, where s is the number of steps in the route. No coded procedures are required, but you should give details of each stage of the process ii) Assume that it is possible to reach the exit from every point in the maze. What is the time taken by your pre-game procedure? Explain your answer. hl The Rellman-Ford algorithm is applied to the following graph, with source 3a You are implementing a game in which a player attempts to escape from a maze. The maze exists within a M x N grid, has one exit, and is defined by a set of connections. From their current location the player can move horizontally or vertically to a neighbouring point, but only if a connection exists to that point. So, only if a connection [[1,2], [1,3]] is part of the maze's definition, is it possible to take a step between points [1,2] and [1,3] in either direction. i) An escape route is a way to reach the exit in the fewest steps. Starting with the list C = [G, . . .,Ck] of connections and the location [ex, ey] of the exit, describe the operations you would perform before the game is played so that an escape route from any point [x, yl can be obtained during the game within (s) time, where s is the number of steps in the route. No coded procedures are required, but you should give details of each stage of the process ii) Assume that it is possible to reach the exit from every point in the maze. What is the time taken by your pre-game procedure? Explain your answer. hl The Rellman-Ford algorithm is applied to the following graph, with source