there are three questions and notes that should be accompanied b this question

1. The deferred acceptance algorithm. Consider a matching market with four firms, f1, f2, f3 and f4 and five workers, W1, W2, W3, w4 and w5 with preferences P(f1) = W1, W5, WA, W3, W2 P(w1) = f4, f2, f1, f3 P( f2) = W1, W3, W5, W2, WA P(w2) = f1, f2, f3, f4 P( f3) = WA, W2, W3, W5, W1 P(w3) = f1, f3, f4, f2 P(f4) = W5, W3, W2, W1, WA P(WA) = f4, f2, f1, f3 P(w5) = f4, f2, f3, f1 (a) Write down an unstable matching in which every firm is matched to a worker. What is the matching's blocking pair? (b) Write down the steps in the firm-proposing deferred acceptance algorithm. What is the resulting matching? Please write the a match with the worker first and order matches within a matching by the worker's subscript (as I've done in part (a)). (c) Write down the steps in the worker-proposing deferred acceptance algorithm. What is the resulting matching? Please write the a match with the worker first and order matches within a matching by the worker's subscript (as I've done in part (a))