HELP I WILL THUMBS UP! :) I need help with this C++ problem. Please let me know if you don't understand anything in the comments.Thanks!!

2. Efficient Harvest A farmer uses pivot irrigation to water a circular field of crops. Due to varying conditions, the field does not produce consistently. The farmer wants to achieve maximum profit using limited resources for harvest. The field is segmented into a number of equal segments, and a profit is calculated for each segment. This profit is the cost to harvest versus the sale price of the produce. The farmer will harvest a number of contiguous segments along with those opposite. Determine the maximum profit the farmer can achieve. For example, the field is divided into na 6 sections and will select k = 2 contiguous sections and those opposite for harvest. The profit estimates are profit = [1, 5, 1, 3, 7, -3) respectively. The diagrams below show the possible choices with profits[0] at the 9 o'clock position and filling counterclockwise. -3 7 -3 7 -3 7 3 3 3 3 5 1 51 5 1 The profit levels, from left to right, are 1 + 5 + 7 + 3 = 16, 5+1 +7+-3 = 10, and 1 + 3+-3 + 1 = 2. The maximum profit is 16. Function Description Complete the function maxProfit in the editor below. The function must return the maximum profit achievable. maxProfit has the following parameters: k: an integer that denotes half of the needed number of pieces of the field profit[profit[O]....profit[n-1]]: an array of integers that denote the profit from harvesting each of the pieces Constraints . 1 skan/2 2sns 105 nis even Os profit[i] / $ 109where 0 sisn-1 O * * 1 > #include ... 9 [ 10 11 * Complete the maxProfit' function below. 12 13 * The function is expected to return a LONG_INTEGER. 14 * The function accepts following parameters: 15 1. INTEGER K 16 2. INTEGER_ARRAY profit 17 18 19 long maxProfit(int k, vector int> profit) { 20 21 } 22 23 int main(). * st