Question 1 [12 points] Consider a matching problem with 3 colleges X, Y,Z and 14 students a, b, c, d, e, f, g, h, i, j, k, 1, m, n. The tables of preferences of colleges and students are given below. The number on the left of a college gives the number of positions available at the college. Find a stable matching using the college proposing algorithm and find a stable matching using the student proposing algorithm. colleges (6) X abcdefghijklmn (6) Y nmlkjihgfedcba (4) Z ijabklcamnefgh students a YXZ b YXZ C Y XZ d YXZ e YXZ f Y X Z YXZ h Y XZ i YXZ YXZ k XYZ 1 XYZ m XYZ n XYZ