For the stable matching problem $($where n men propose to n women$),$ what is the time complexity of Gale$-$Shapley algorithm?

Group of answer choices

O$($n$)$

O$($n log n$)$

O$($n$^3)$

O$($n $*$ n$)$