Please help with question 5

5. Create an O(n) algorithm (comparisons) for the following problem. Given a list of 2n+1(n=1,2,3) distinct positive integers, partition the list into two sublists, each of size n, such that the difference between the sums of these two sublists is maximized. We may assume that the median of the 2n +1 integers is known and located at the head of the original list. See below for the definition of median. What is Median? 1336789 (when length of the list is odd number) Median =6 12345689 (when length of the list is even number) Median =(4+5)/2=4.5