Problem Statement Let us consider carpooling apps like ela/uber app. The agent has to decide at any intermediate node, he can choose the next stop which has the least travel fare per hour. The following graph will give the cities with their time and fare. 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 taken by the passenger to reach the goal. 700 B B 500/3hr 1250/2hr 500 A 590/1.5hr 850/3hr D 500 1500/3hr 1000/4hr G 650/2hr 600/3hr 700/2hr 2500/3hr E 750 600 Note: 1. Explain the environment of the agent [20% weightage] 2. Find the path and cost with respect to time or fare based on the given problem [60% weightage] 3. Use appropriate data structures and implement a search algorithm to find the path that the agent can visit the cities in the graph. [20% weightage] 4. The starting node has to be taken as input from the user. Instructions: Use well-intended python code. Please keep your work (code, documentation) confidential. Problem solving using Search Algorithm (Students are supposed to find the best algorithm according to the Problem!!) Problem Statement Let us consider carpooling apps like ela/uber app. The agent has to decide at any intermediate node, he can choose the next stop which has the least travel fare per hour. The following graph will give the cities with their time and fare. 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 taken by the passenger to reach the goal. 700 B B 500/3hr 1250/2hr 500 A 590/1.5hr 850/3hr D 500 1500/3hr 1000/4hr G 650/2hr 600/3hr 700/2hr 2500/3hr E 750 600 Note: 1. Explain the environment of the agent [20% weightage] 2. Find the path and cost with respect to time or fare based on the given problem [60% weightage] 3. Use appropriate data structures and implement a search algorithm to find the path that the agent can visit the cities in the graph. [20% weightage] 4. The starting node has to be taken as input from the user. Instructions: Use well-intended python code. Please keep your work (code, documentation) confidential. Problem solving using Search Algorithm (Students are supposed to find the best algorithm according to the Problem!!)