*** here is given qsort.c

Modify the given qsort.c program in the following ways: (1) change low , high ,and middle to be pointers to array elements rather than integers representing the array indices. Change the split function to return a pointer, not an integer. (2) Move the quicksort and split functions in a separate file named quicksort.c .Create a header file named quicksort.h that contains prototypes for the two functions. Include this header file in both qsort.c and quicksort . c. After your modifications, write a Makefile that compiles the whole program into an executable called qsort You must create intermediate targets, as shown in class. Do not simply put everything in one target as this is not a good practice, in terms of incremental compilation Files that need to be on GitHub: qsort. c -contains the modified version of the program quicksort.c . Makefile to compile the program int split(int al], int low, int high) [ int part element = a[low] for(::) I while (lowhigh && part element = a[high]) high- if (low = high) break allow++] a[high] while (lowhigh && a[10 (z part element) lowtt if (low >- high) break a [high-] = a[low] ; a[high] part-element return high Modify the given qsort.c program in the following ways: (1) change low , high ,and middle to be pointers to array elements rather than integers representing the array indices. Change the split function to return a pointer, not an integer. (2) Move the quicksort and split functions in a separate file named quicksort.c .Create a header file named quicksort.h that contains prototypes for the two functions. Include this header file in both qsort.c and quicksort . c. After your modifications, write a Makefile that compiles the whole program into an executable called qsort You must create intermediate targets, as shown in class. Do not simply put everything in one target as this is not a good practice, in terms of incremental compilation Files that need to be on GitHub: qsort. c -contains the modified version of the program quicksort.c . Makefile to compile the program int split(int al], int low, int high) [ int part element = a[low] for(::) I while (lowhigh && part element = a[high]) high- if (low = high) break allow++] a[high] while (lowhigh && a[10 (z part element) lowtt if (low >- high) break a [high-] = a[low] ; a[high] part-element return high