PLEASE SOLVE THE BELOW QUESTION WHICH HAVE BOXES IN GREY COLOR:

nash equilibria?

value of y?

value of x?

best graph function?

Question 4 2 pts Just like any other undergraduate student, Arvind knows the importance of arriving before his roommate when it comes to moving into his dorm room. However, he also recognizes the difficulty in moving at exactly the same time as his roommate; everyone is cramped in the stairways, hallways, and in the elevator, and there's a limit to the number of bodies that can fit in that small room at once to unpack. Since Arvind is a first-year student, the university assigned Ramesh to be his roommate. Assume that it is impossible for either roommate to get in touch with the other one prior to move-in day. So each roommate must decide simultaneously whether to arrive in the morning or afternoon. If they move in at the same time, each receives a payoff of 0; if they move in at different times, each receives a positive payoff, but the person arriving in the morning is better off. The following payoff matrix represents the game they must play. Ramesh Morning Afternoon Morning 0, 0 15, 10 Arvind Afternoon 10, 15 0,0 What are the pure strategy Nash equilibria? [ Select ]Let's take a look at mixed strategies. Suppose a {1 - x } is the probability that Arvind plays Morning (Afternoon] and y {1 - y} is the probability that Ramesh plays Morning [Afternoon]. At a certain value of y. Arvind is indifferent to choosing between always selecting the morning and always selecting the afternoon. What is this value of y? [ Select ] At a certain value of r, Ramesh is indifferent to choosing between always selecting the morning and always selecting the afternoon. What is this value of r? [ Select ] Given your solution to the game above, choose the plot which shows the best response functions of both students. (r: Arvind's probability of choosing morning. y: Ramesh's probability of choosing morning)