The analysis of the Gale-Shapley algorithm establishes that every instance of the stable matching problem admits at least one stable matching. Here we consider how many such matchings might exist. Give an algorithm that takes an instance of the stable matching problem as input and decides if there is exactly one stable matching for this instance (that is, the algorithm outputs either unique stable matching, or more than one stable matching). Pay close attention to the proof of correctness of your algorithm.