please use C

Q1. Sorting Algorithms are a core area of concern of computer scientists and engineers. These algorithms are used to arrange a set of elements in a certain order based on their values. For this lab, we will be implementing one such algorithm, Selection Sort. Selection Sort works as follows, when given an array, you iterate through the elements and put the smallest element first. Then, you iterate through the array again starting with the next element and replace that element with the next smallest value. You do this until the end of the array and it is sorted! See the example below for more clarity if you're still confused. For this assignment, use the template given it makes it easier) and YOU MUST USE POINTER NOTATION, not array notation. After the use of square brackets to make the array in the template, you should not use them again. The template takes in input for the number of elements in the array and the elements of the array. Note: to save time, after entering the number of elements, you can enter the elements individually, or just copy and paste the space separated values. Example of selection sort: on array 5, 3, 1, 2 -> blue shows the numbers that changed 5312 1352 1253 12 35 Sample output #1: (copy and paste this: 5 2 1 4 6 5 9 8 10 3 7) Please enter the number of elements to be sorted: 11 Please enter 11 elements: 5 2 1 4 6 5 9 8 10 3 7 5 2 1 4 6 5 9 8 10 3 7 1 2 3 4 5 5 6 7 8 9 10 Sample output #2: (copy and paste this: 11 32 123 45) Please enter the number of elements to be sorted: 4 Please enter 4 elements: 11 32 123 45 11 32 123 45 11 32 45 123