1. (10 pts) Arrange the following functions in ascending order of asymptotic growth rate; that is, if function g(n) immediately follows function f(n) in your list, then it should be the case that f(n) is O(g(n)): 2 Vlogn, 2, n4/3, n(logn)?, nlogn22, 272. (There is no need to justify your answer.) 2. (10 pts) Consider a stable marriage instance with men M = {m, M2, M3} and women W = {w1, W2, W3} having the following preference lists: mi : wi > W2 > W3 wi: m2 > mi > m3 m2 : W2 > wi > W3 w2: mi > m2 > m3 m3 : w1 > W2 > W3 w3: m > m2 > m3 a. If these preferences are given to the Gale-Shapley algorithm, what is the resulting set of marriages