please, full code, in parts, with output:

Consider the following congestion network with three nodes. As shown, an edge has the cost function c(x)=x if the flow (number of users) on that edge is x, except for the edges vu and wu where c(x)=0. The table on the right shows four users i=1,2,3,4 with different origins oi and destinations di. In this network, each user has two possible routes from her origin to her destination (a) Develop an algorithm, say Best-response dynamics, and implmenent it to find two equilibria of this congestion game, one with low cost and one with high cost. (do explain how the algorithm works and why)[5 marks] Consider the following congestion network with three nodes. As shown, an edge has the cost function c(x)=x if the flow (number of users) on that edge is x, except for the edges vu and wu where c(x)=0. The table on the right shows four users i=1,2,3,4 with different origins oi and destinations di. In this network, each user has two possible routes from her origin to her destination (a) Develop an algorithm, say Best-response dynamics, and implmenent it to find two equilibria of this congestion game, one with low cost and one with high cost. (do explain how the algorithm works and why)[5 marks]