PLEASE SOLVE IN PYTHON ONLY

PYTHON ONLY

PYTHON ONLY PYTHON ONLY PYTHON ONLY

1h 9m left Language C++ 2. Code Question 2 26 1> #include 9 ALL 10 o 11 /* * Comple US 97-5 12 * tecmint.com... 13 * The fur 14 * The fun are - UBNetDe... 1 An Amazon seller is deciding which of their products to invest in for the next quarter to maximize their profits. They have each of their products listed as segments of a circle. Due to varying market conditions, the products do not sell consistently. The seller wants to achieve maximum profit using limited resources for investment. The product list is segmented into a number of equal segments, and a projected profit is calculated for each segment. The projected profit is the cost to invest versus the sale price of the product. The seller has chosen to invest in a 15 * 1. INTE cdr-vcenter.cse... 16 * 2. INTE 2 17 */ 18 19 long maxProfi 20 number of contiguous segments along with those opposite. Determine the maximum profit the seller can achieve using this approach. 21 } 22 23 > int main() --- For example, the product list is divided into n = 6 sections and will select k = 2 contiguous sections and those opposite to invest in. The profit estimates are profit = [1.5, 1, 3, 7, 3) respectively. The diagrams below show the possible choices with 15 iCloud Apple Google home Mitchell-Elbus ashutosh-1997-S https://www.t...ss-in-ubuntu/ Git C M H Hacker... in U U 00 1h 9m left -3 7 -37 -3 Language C++ 7 3 1 3 1 3 4 S 1 1 > #include int main() -- Constraints Iskan/2 2 sns 10 ve