Write the pseudocode for a function that checks if a given matching is a stable matching. The function should take as argument the matching, the 2D array Ranking, the array Current, and N, where N = |M| = |W|, M is the set of men, and W is the set of women. The function should return True if the given matching is a stable matching and False otherwise. Your algorithm must run in O(N^2) time in the worst-case; explain how your algorithm achieves this. To clarify the pseudocode, you may also have your function take the sets M and W as arguments and treat them as arrays, where m_i = M [i] and w_i = W [i].

Context: We have been discussing the Gale-Shapely Algorithm in class.