Problem 1: (Sorting) Write a program that sorts n integers, from smallest to largest, with what's called the selection sort method. The input and output should be exactly How many numbers do vou have'? [USER ENTERS A POSITIVE INTEGER] Input number (count 1): [USER ENTERS A INTEGER] Input number (count 2): LUSER ENTERS A INTEGER] Input number (count X): LUSER ENTERS A INTEGER The sorted input is: X (count 1) X (count 2) X (count X) You may not use any libraries aside from iostream and string Hint. There are many ways to sort an array, and some are quite sophisticated. In my opinion, the selection sort method is the simplest (although not the best). We suggest you write your program in the following steps. Get the number n from the user. Create a dynamically allocated array of size rn. Store the numbers in the array. Find the smallest entry among entries 0 to n-1. Swap the smallest entry with entry 0, 1.e., store the value of the Oth int, write the smallest int into the Oth spot, and write the stored int into the spot the smallest int used to occupy. Find the smallest entry among entries 1 to n-1, and swap the smallest entry with entry 1