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. 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. Dynamically get the start and goal city while execution as inputs. The average of the total transmission cost across all these paths is the heuristic value h(n). Use the following algorithms to find the optimal network connections and help the network agent. a. Hill Climbing Algorithm b. Recursive Best First Search

Use both the above mentioned algorithms and implement in PYTHON

Print the optimal connections that keeps the whole network up and running.

Include code in your implementation to calculate the space complexity and time complexity for the informed search and print the same. For local search interpret the significance of the hyperparameters if any applicable