Objective Expand the understanding of arrays and debugging a simple sorting algorithm. This assignment helps develop the debugging skill and facilitates a continued understanding of arrays, loops and algorithms Introductiorn A simple sorting algorithm (Selection Sort - kind of see Appendix B for an unsorted single dimensional array is to use two loops. The outer loop (i) for each element except for the last, will compare and swap data for every inner loop G) for each element starting at the next outer loop index. See Appendix A for a code example. The code example is to sort an array in descending order. This is not a Bubble sort, just another simplified sorting algorithm. So stay away from the internet and use your brain, you may have to do this or a test, without the aid of Bing or Google 1. Add comments, fix logic and retain original code in comments to make the algorithm functionally correct. 2. The Analysis; capture the number of outer loops, number of inner loops and number of swaps (You may have to "instrument" your code). Elicit more information. a. Does the code behave: number of outer-loops-n-1, inner-loops -n/2 and conditionals about 40% swaps? Where n is the number of elements Your assignment is to understand how the sort should work, debug the code in Appendix A, and supply the fixes Deliverables &Questions-40pts Follow the coding standards specification 1. 2. Your file name will be Hw7.c Add Analysis answers in the header comment