Problem 10: You are the manager of a temp agency. Currently you have five workers, W1, W2, W3, W4, and W5, and five companies, C1, C2, C3, C4, and C5, who need a worker, each. Both workers express their preferences of these companies, and companies sent their preferences over workers. The table below describe these preferences in decreasing order: W1 C4 C2 C5 C3 W2 C2 C1 C5 C4 C3 W3 C4 Ci C5 C3 C4 W4 ci C5 C4 C2 C3 W5 C5 C2 C3 C1 C1 W5 W1 W2 W3 W4 C2 W4 W5 W1 W2 W4 C3 W4 W2 W1 W3 W5 C4 W3 W4 W5 W1 W2 C5 Wi W2 W3 W4 W5 C4 In other words, worker W1 prefers company C4 the most, and company C5 prefers worker Wi the most, ete. Find the worker optimal stable matching by running the Gale-Shapley algo- rithm. 10 points