1. Consider the following three-player game-frame (where ol, 02,...,018 are the possible outcomes): Player 2 D E F 01 02 03 Player 1 04 05 06 07 08 09 Player 3: G Player 2 D E F A 010 011 012 Player 1 B 013 014 015 016 017 018 Player 3: H The players rank the outcomes as follows: 07, 016 best 04, 014 015 013 best 01, 012 05, 014 09 Player 1: 05, 013 Player 2: ol, 07,011 06, 012 02 02, 08, 017 ol 1, 018 03, 04, 09, 010, 015, 016,018 worst 06 03, 08,010,017 worst 012 best 015 03, 06, 016 Player 3: ol1 02, 07, 014, 017 08, 010, 013, 018 01, 04, 05, 09 worst Page 1 of 2 (a) For each player write a utility function that represents her ranking, using consecutive integers with 0 being the lowest. Use these utility functions to obtain a game based on the above game-frame. (b) For each player find all the strategies that are strictly dominated. (c) What do you get by applying the iterated deletion of strictly dominated strategies? (d) Are there any Nash equilibria