Program that does the following:
a. Defines an array of integers called my_ints with a pre-specified size of 4.
b. Populates my_ints with input data provided by the user.
c. Defines an array of pointers called my_ptrs of the same size as my_ints and initializes the pointers in my_ptrs to point to corresponding elements of the array my_ints (refer to the "Initial state of my_ptrs" in the example shown below).
d. Sort the contents of the my_ptrs array in ascending order. You are allowed to use any existing sorting algorithm (two simple options are Bubble Sort and Insertion Sort; you may use either one or choose another one if you prefer). However, you are NOT allowed to use a library implementation of the algorithm. You must implement the algorithm from scratch.
e. What you have done above is to sort the values contained in the my_ptrs array, i.e., you have sorted memory addresses. Now, update your code to sort the my_ptrs array based on the integers that are being pointed to, i.e., the first element of my_ptrs should point to the smallest element in my_ints, the second element of my_ptrs should point to the next larger element in my_ints, etc. (refer to the "State of my_ptrs after Step 2e" in the example shown below). The my_ints array should NOT be changed in any way; the values should stay in the same position. You have already implemented this part of sorting from the steps above, but that was not using pointers, so now you need to sort it using pointers.
f. Traverse the array my_ptrs and print the values being pointed to by each pointer in this array.
