Consider the preferences lists of the stable marriage algorithm. assume that the ranking lists of all women by the men are the same, and analogously, the ranking of all men by the women are the same. in other words, there is a consensus between the women on who the favorite man is, who the second favorite man is, and so on. prove that given this scenario, there is only one stable matching. what is it? (note that in general, the tma finds one of possible multiple stable matching)