Suppose you are given the following one-shot, non-cooperative, simultaneous-move game:

BP and Exxon are deciding whether or not to charge a high price or a low price for gasoline sales tomorrow. The two firms cannot collude, and both will post their prices tomorrow at the same time. This game has the following payoff matrix(profits for the day are in parentheses, with BP profits listed first)

\\tablel[[, High Price,Low Price], [High Price,($ 800, $800), (- $300, $1,000) Suppose you are given the following one-shot, non-cooperative, simultaneous-move game: BP and Exxon are deciding whether or not to charge a high price or a low price for gasoline sales tomorrow. The two firms cannot collude, and both will post their prices tomorrow at the same time. This game has the following payoff matrix (profits for the day are in parentheses, with BP profits listed first): Exxon High Price Low Price ($800, $800) (-$300, $1,000) (1,000, -$300) {8500, $500) What would be the solution to this game? Explain your reasoning (since this is a 10- point question, clearly I'm looking for specifics)