6. MATCHING (15PTS) Consider a matching problem between 3 female players (X1, X2, 23) and 3 male players (y1, y2, y3). The players' preference rankings are given in Table 3: TABLE 2. Preference Rankings by the Female (x) and Male (y) Players 2 2 X3 y1 y2 y3 1st y1 y2 y1 X 1 X 1 2nd y2 y1 y2 2 2 20 2 3rd y3 XX 3 X 3 X 1 Find a stable matching using the Deferred Acceptance Procedure. Clearly illustrate how you arrive at your