I would like to ask help with this c programming task. Make a c program with the following details:

Problem Statement Following the problem definition at Module 10, the median of a list of integers is the middle element of a list when it is sorted (in increasing order). For example 1 2 4 7 8 9 11 13 16 The median for this list is 5, at position 5 1 24.7.8.9 11 13 The median (lower median) for this list is 7 at position An O(N)O(N) algorithm (we shall refer to as QUICK-SELECT) exists that can be used to find the median in a list of integers. QUICK-SELECT takes an integer array A start and end indices (p and q. respectively), and a rank r integer. The rank of an integer in the list is its position in the sorted list For example, the rank of 8 in the list above is 5. QUICK-SELECT returns the rthrth ranked integer in the list. To get the median of a list with NN elements, we can use QUICK-SELECT with rank (N+1)/2]1(N+1)/2]. An example pseudocode of QUICK-SELECT as given in our main reference (Cormen et al. Book) is given below: quick_select (A, D, I, rank) if p == 1 return Ap] q = median_partition (A, D, I) K = q - p + 1 if rank == k return Agi else if rank from 66 A[]