Write a program in C to a) Sort an array of integers using standard bubble sort algorithm. Also implement a variation of bubble sort that use both early termination and alternate passes in opposite direction. b) Sort an array of integers using standard insertion sort algorithm. Also implement a variation of insertion sort that use binary search to find the proper location to insert the next element instead of linear search. Input to the program is the size of array. Generate numbers using random number generator. For each part of the program, show the intermediate output and total number of comparisons after each pass. For 2(b), also print the number of elements required to move in order to free the proper location of next element after each pass.