Anna and Bill are roommates. Each of them can choose whether to clean the apartment ("Clean") or leave it dirty ("Dirty"). If nobody cleans the apartment, they each get a payoff of zero. If they both clean the apartment, they each get a payoff of 4. If only one of them cleans, the person who leaves it dirty gets to enjoy a clean apartment without having to put in any effort. That person will receive a payoff of 5, while the person who does the cleaning will receive a payoff of 2. Upload an image of the payoff matrix for this game, assuming that the choices are made simultaneously. What are the pure strategy Nash Equilibria of this game (if any)? (Clean, Clean) (Clean, Dirty) (Dirty, Clean) (Dirty, Dirty) There is no pure strategy Nash Equilibrium