For this assignment, you can assume you have a 2D board of 20 by 20 size, where the start state is (1,1) and goal state is (19,19). Write a program that will show the path from start to goal using A* search algorithm. You will show two solutions for Manhattan and Euclidean distance.
