1(a). Two colleagues, Leila and Junshang, share an office which needs some cleaning. Both would like a clean office. However, each of them prefers not to be the one that does the cleaning. Here's the pay-off matrix of the game between Leila and Junshang. Junshang Clean Don't Clean Leila Clean Don't Clean 3, 3 4, 3 33 3, 4 1, 1 Question text (e) Imagine that this was a sequential game (instead of a simultaneous game) and that Leila could move first. Write down the game tree representing this sequential version of the game, and predict what the outcome would be. Explain clearly how you arrived at the solution. (You can attach a photo of your work.)