Q6 Problem Statement Let us consider one traveling app like MakeMy trip. There are source and destination cities where the agent has to decide on which path he needs to travel. The following graph will give the cities with their time and fare. Here Start node is A and the Goal node is G. Note that the edge value from A to B "500/3hr represents 500 is maximum fare and 3hr is the maximum time taken to reach A to B or vice-versa. Find the path which takes the least time to reach the destination. 3hr B 500/3he 1250/Shr Shra 590/15 850/3 1500/2hr Ohr E 5hr 1.5hr 1 Python code required with following information (code file in format: jpynb) #Define the agent environment in the following block #PEAS environment, Initial data structures to define the graph and variable declarations #Coding begins here #Implementation of appropriate Search Algorithm (Students are supposed to find the best algorithm according to the Problem from Informed or uninformed or local search) #Calling main function #The agent should provide the following output #The path taken by agent #Call the Function that prints the path taken by the agent #The cost of the path taken #Call the Function that prints the cost of the path Q6 Problem Statement Let us consider one traveling app like MakeMy trip. There are source and destination cities where the agent has to decide on which path he needs to travel. The following graph will give the cities with their time and fare. Here Start node is A and the Goal node is G. Note that the edge value from A to B "500/3hr represents 500 is maximum fare and 3hr is the maximum time taken to reach A to B or vice-versa. Find the path which takes the least time to reach the destination. 3hr B 500/3he 1250/Shr Shra 590/15 850/3 1500/2hr Ohr E 5hr 1.5hr 1 Python code required with following information (code file in format: jpynb) #Define the agent environment in the following block #PEAS environment, Initial data structures to define the graph and variable declarations #Coding begins here #Implementation of appropriate Search Algorithm (Students are supposed to find the best algorithm according to the Problem from Informed or uninformed or local search) #Calling main function #The agent should provide the following output #The path taken by agent #Call the Function that prints the path taken by the agent #The cost of the path taken #Call the Function that prints the cost of the path