Examine the pseudocode for the Gale$-$Shapley algorithm provided in the textbook or in lecture.

Describe a set of data structures you would use to fully implement the algorithm. Again using n

and s$,$ write an expression for the size of the representation required to run the algorithm.