Nadia and maddie are two college roommates who both prefer a clean common space in their dorm room, but neither enjoys cleaning. the roommates must each make a decision to either clean or not clean the dorm room's common space. the payoff table for this situation is provided below, where the higher a player's payoff number, the better off that player is. the payoffs in each cell are shown as (payoff for nadia, payoff for maddie). what is the nash equilibrium in this dorm room cleaning game? a nadia: clean maddie: clean b nadia: don't clean maddie: don't clean c. nadia: clean maddie: don't clean d nadia: don't clean maddie: clean