Find a stable marriage matching for the instance given in Problem 1 by applying the stable marriage algorithm
a. in its men-proposing version.
b. in its women-proposing version.
Problem 1
Consider an instance of the stable marriage problem given by the following ranking matrix:
For each of its marriage matchings, indicate whether it is stable or not. For the unstable matchings, specify a blocking pair. For the stable matchings, indicate whether they are man-optimal, woman-optimal, or neither. (Assume that the Greek and Roman letters denote the men and women, respectively.)