Consider the following variation of the Selection Problem: Given a sequence $S = \langle a_1, a_2, \ldots, a_n \rangle$ of $n$ distinct integers and two positive integers $x$ and $y$, where each number in $S$ falls between 1 and $y$, the goal is to report the smallest $x$ numbers in $S$ in ascending order. This scenario assumes the conventional single-processor, random access machine (RAM) model, with a machine word size of at least $\lceil \log y \rceil$ bits. To tackle this problem, five algorithms have been proposed. Please select the correct description(s) below.