2. Following function is to sort a sequence saved in the array L.r[L.length] in ascending order using the insertion sorting algorithm. Instead of sequential search, binary search is used to find the position where a key should be inserted into the sorted portion. Please finish the program. #define MAXSIZE 20 typedef int Key Type; typedef struct int r[MAXSIZE+1]; int length; }SqList; void InsertSort (SqList &L) { for (i=1;i=low; --j)L.r[j+1] =- L.r[high+1] =temp; // insert the key to the proper position } }