3 ( Network Game ) Consider the following puzzle The are two agents N= 123 They need to travel from forint ' a ' to pout 6 , in figure. 1 . There one 3 possible paths. i ) Path u: a x -b. Path D : a ty -b Path M: a n - y = b . e ( x ) = 1 . O c (a ) = 0 c ( a ) - 1 c (Q ) = x figure 1 .The corof frond infarce pretty is the Sum of cob of brand in Eachof the Edges in these patty . Coorofeach edgeis c (x) where X E SO, t, ly = fraction of agents who traned on her edges . The value of travel from a d to bo is agent . therefore the Bayity of cach agent ; him / her value minus her / his kand cot . ( @ ) , famulato the above as a Normal from Gone . Find all Nash Equlisia in the game