Question 4: There are 2n positive integers written on a whiteboard. H…

There are $2n$ positive integers written on a whiteboard. Here is a one-player game with these numbers: You start with a score of 0 . You will increase your score by performing the following move exactly $n$ times:

• Choose two integers $x$ and $y$ that are written on the whiteboard.
• Add $\min(x, y)$ to your score.
• Erase $x$ and $y$ from the whiteboard.

Note that after performing the move $n$ times, there will be no more integers written on the whiteboard. In general, our goal is to find the maximum final score you can achieve if you optimally perform the $n$ moves.

We will refer to this value as the answer.

Based on the above data answer the given subquestions.

What is the general strategy for solving this problem? Select all strategies that are correct.