Make up preference lists that maximize the number of broken engagements during a run of the GS algorithm where there are 3 men and 3 women: m: [, ,] n: [, ,] o: [, ,] w: [, ,] x: [, ,] y: [, ,]. What was the maximum number of broken engagements using the preference lists you made up? (I found preference lists that cause 4 broken engagements during the algorithm.) _______ If the size of the sets of men and women is some number n: i. What is an upper bound on the number of broken engagements in a run of the Gale-Shapley algorithm for n = 2? ______ ii. For n = 3 ? _________ iii. For any n? _______ What did our simple upper bound assume that wasn't right? (We're looking for something aightforward here) __________