3. Sorting Arrays When we swap two variables x and y, the value of x gets copied onto y and vice- versa. In general, we utilize a third variable to temporarily store one of the values we are swapping. If we wanted to enforce an order on our array, perhaps an z-a reverse lexicographic order, we would then need to swap all of the letters into the correct positions in the array. This means the letter with the lowest ASCIl value would be farthest to the left, and the letter with the highest ASCIl value would be farthest to the right. The provided code template gives you a starting point on how to go about enforcing an z-a reverse lexicographic ordering (i.e. descending order) on the following array #include using nanespace atd: int main (0 for (int i-lak6:tti) //write an ir-else block heze coutccendi: return 0 Your first objective is to write an if-else block that uses the algorithm for swapping so that the first element of the array is the first letter of the alphabet (lowest ASCIl value character). Your second objective is to modify the for-loop with the if-else block such that every time the for-loop with the if-eise block is executed it processes progressively smaller arrays. You should nest the for-loop with the if-else block inside another for-loop and then modify the index variable i's bounds to achieve this. For example, the first time it is executed it should process the entire array, the second time it should process the entire array except the first position, the 4