Vrite a program that uses a graph-based path planning algorithm (i.e., A ) to guide the driverless ar for traveling between two city halls. 1- Write the function PathFinder where the input arguments to the function are the name of two cities and the search algorithm. a. Example: when you call the function PathFinder (VA, LA, A_Star), it returns the optimal path between Vancouver and Langley using A algorithm. b. (required) the function should implement the A algorithm c. (optional/bonus) extend your code to include Grassfire and Dijsktra's algorithms as well. 2- Write your program with an intuitive user interaction parts for both taking the inputs from the user to providing the results