Can you Please provide python code for the given graph by implementiong the given $2$ algorithms

Problem statement

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$.$ A$*$

b$.$ Genetic Algorithm

Evaluations will be based on the following:

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

$2.$ Use both the above$-$mentioned algorithms and construct the solution. $($If possible implement in PYTHON$)$