Q.3) Constraint Satisfaction Problems: Modeling (8 points) Your task in this question is to model the graphical game described below as a constraint satisfaction problem in such a way that any solution to the CSP must be a Nash Equilibrium of the game. To describe your CSP model, please define the variables, explain their meaning and domain, and represent the constraint by a list of compatible value combinations or a list of no-goods. A Graphical Game on a Cycle In this game, the underlying graph of n players {1,2,3,.--n} is a cycle. All players have the same action set A= {0,1}. For a given assignment of actions to the players (21, 22, ... , an), the utility/payoff of player i is V (1,Q;,y) = Qi (r +q+ y) modulo 2) Here r and y are the actions of the two neighbors of player i. Nash Equilibrium: A Nash equilibrium in this game is an assignment of actions to the players such that no player can get a larger payoff by changing the assigned action unilaterally