What was the major reason the algorithm for solving the stable matching problem as described in Chapter $2$ used several different data structures to solve the problem?

Group of answer choices

There was no way to solve the problem without using those additional data structures.

To decompose the solution to make it easier to handle each step on its own.

To ensure the key operations of the algorithm could all be performed in O$(1)$ time.

To ensure the key operations of the algorithm could all be performed in O$($N$)$ or less time.