How would I go about solving this? Please show and explain your work.

1 Universal Preference Suppose that preferences in a stable matching instance are universal: all n jobs share the preferences C1>C2>>Cn and all candidates share the preferences J1>J2>>Jn. (a) What pairing do we get from running the algorithm with jobs proposing? Can you prove this happens for all n ? (b) What pairing do we get from running the algorithm with candidates proposing? (c) What does this tell us about the number of stable pairings