Write a complete C code which uses a hybrid sort for sorting 20 numbers. Use the previously developed sorting algorithms, namely insertion or bubble and the merge procedure developed in Programing Assignment #1 - part 2 such that you code should: Divide the initial list of 20 numbers into 2 sets of 10 numbers, and apply (insert sort or bubble sort) to each set independently. Sort the numbers by applying the MERGE procedure to produce the sorted list. Code template: #define SIZE = 20 int main() {int arr[SIZE] = {44, 20, 8, 9, 7, 8, 1, 2, 5, 4, 30, 15, 10, 77, 19, 81, 11, 46, 50, 3};//Divide the array into two subarrays of 10 each//Sort each subarray using bubble or insert algorithm//Merge the two using the merge procedure developed before printf("Original array = "); for (i = 0; i