Given below are the shared and distributed servers placed at various locations in your city. Now imagine it to be in a crisis and you have been asked to compromise some communication lines and keep a minimum number of connections to keep the network up and going. You are required to find the sub set of connections for your work to go un-interrupted. Use the following algorithms to find the minimum network connections possible and help the network agent. a. Breadth First Search and b. Recursive Best First Search

Note 1: The edge costs depicted below is an approximation towards the transmission cost between any pair of nodes. For heuristic design, consider all the possible paths between any arbitrary node n to the goal node. The average of the total transmission cost across all these paths is the heuristic value h(n). Evaluations will be based on the following.

1. Explain the PEAS (Performance measure, Environment, Actuator, Sensor.) for your agent. (20% marks)

2. Use Breadth First Search and Recursive Best First Search and implement the algorithms in PYTHON. The program should be able to take-in start and goal nodes dynamically from the user at run time. Compare to interpret the results in terms of the algorithm working, performance & shortest path if obtained relevant to the given problem. (20% + 20% = 40% marks)

3. Print the minimum connections that keeps the whole network up and running. For each incremental depth limit, corresponding node generating sequence should be legibly printed in the result. (20% marks)

4. Include code in your implementation to calculate the space complexity and time complexity and print the same. (20% marks)

a. Breadth First Search and b. Recursive Best First Search Note 1: The edge costs depicted below is an approximation towards the transmission cost between any pair of nodes. For heuristic design, consider all the possible paths between any arbitrary node n to the goal node. The average of the total transmission cost across all these paths is the heuristic value h(n)