Problem itatement Given the below maze configuration, the task of the robot is to navigate in the mare and find the optimal path to reach the finish position. It can move to the north, south, west and cast dircction. While navigating through the environment it has obstacles like walls. For each transition, a path cost of +3 is added in scarch. Assume that the robot's vision sensors are sensitive to the exposure to the sunlight and whenever it tries to move towards the east direction resulting in incurring an additional penalty of +5 cost. Use Euclidean distance as a heuristic wherever necessary. Use the following algorithms to find the optimal path. a. Iterative Deepening A b. Hill Climbing Algorithm Evaluations will be based on the following: 1. Explain the PEAS (Performance measure, Environment, Actuator, Sensor) for your agent. (20\% marks) 2. Use both the above mentioned algorithms and implement in PYTHON. (20%0+20% =40% marks) 3. Print the optimal path sequence with costs, (20% marks ) 4. Include code in your implementation to caleulate the tpece complexity and time complexity for the informed scarch and print the aame. For local scarch interpret the significance of the hyperperameters if any applicable . (20\% marks) Note 2: - You are provided with the python notcbook template which stipulates the strocture of code and documentation. Use well intended python code. - Use a scparate MS word document for explaining the theory pert. Do not inclade the thoory part in the Python notebook except Python comments. - The implementation code must be completely original and exccutable. - Please keep your work (code, documentation) confidential. If your code is found to be plagiarized, you will be penalized severely. Parties involved in the copy will be considered equal partners and will be penalized severely