For each of these two problems, your solution should contain the answers to the following questions.

• What are the parameters to this problem?
• What is the desired post-condition for this algorithm?
• What, if any, are necessary pre-conditions for the parameters to this algorithm?

2. Write an algorithm that finds the m smallest numbers in a list of n numbers.

3. Write an algorithm that prints out all the subsets of three elements of a set of n elements. The elements of this set are stored in a list that is the input to the algorithm.