Exercise 15.3 Prove that in every network cost-sharing game in which all agents have a common origin vertex and a common destination vertex, there is a one-to-one correspondence between strong Nash equilibria and minimum-cost outcome.(thus, in such games, strong Nash equilibria always exist and the POA of such equilibria is 1)