Show code thanks

Use python to find the shortest route from A to M, return the names 'n'of all the destinations and 'moves(n)': eg Result(In(a), go(b), ....)= in(m) Show by a function called 'Result(n,m)' also called successor which refers to any given name reachable by a name in one move. Return the result that takes the least distance to get from A to M. With the results show the sum distance. IC isi B 90 25 D J 21) 140 A 111 180 1012 I 97 E 146 E 170 138 175 120 H