Python program for Greedy-BFS

b. Greedy Best First Search 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 =40% marks) 3. Print the optimal connections that keeps the whole network up and running. (20\% marks) 4. Include code in your implementation to calculate the space complexity and time complexity for the informed search and print the same. For local seareh interpret the significance of the hyperparameters if any applicable . ( 20% marks)