a. Write, compile, and run a C++ program that inputs 10 double-precision numbers in an array named raw. After these numbers are entered in the array, your program should cycle through raw 10 times. During each pass through the array, your program should select the lowest value in raw and place it in the next available slot in an array named sorted. When your program is finished, the sorted array should contain the numbers in raw in sorted order from lowest to highest.
b. The method used in Exercise 15a to sort the values in the array is inefficient. Can you determine why? What might be a better method of sorting the numbers in an array?