ALGORITHMS

Write a Python program that uses A* search to print out (to the console, using a print statement) a shortest path from the mouse to the cheese in the above maze. The output should be [(0, 0), (0, 1), (0, 2), (1, 2), (2, 2) (3, 2), (3, 1)]. Write an invariant for the main loop of your search algorithm, which shows that if it returns a path, then it is a shortest path. Name four awesome algorithms (which were studied in this class, or not). Name four commonly used techniques of deductive program verification. Write a Python program that uses A* search to print out (to the console, using a print statement) a shortest path from the mouse to the cheese in the above maze. The output should be [(0, 0), (0, 1), (0, 2), (1, 2), (2, 2) (3, 2), (3, 1)]. Write an invariant for the main loop of your search algorithm, which shows that if it returns a path, then it is a shortest path. Name four awesome algorithms (which were studied in this class, or not). Name four commonly used techniques of deductive program verification