Minimum Complexity Level

The finance team of a company has to attend a conference in which various lectures on investment ideas are to be presented. The subject matter of each lecture has a certain complexity. The order of the lectures has already been planned, but it needs to be scheduled in a way such that each lecture can be presented before the conference ends. Each day's complexity is defined as the complexity of the most complex lecture attended that day. The goal is to attend at least one lecture every day and to minimize the overall complexity of the conference. Given the complexity levels of the lectures, as well as how long the conference will last (in days). What is the overall minimum complexity that can be achieved with optimal planning? Example complexity = [1,5, 3, 2, 4) days = 2 The best option is: Attend the first lecture on day 1. Day 1 complexity = maximum_off 1)= 1. Attend the remaining lectures on day 2. Day 2 complexity = maximum_of( 5, 3, 2, 4) = 5 The overall complexity is 1 + 5 = 6. Function Description Complete the function findMinComplexity in the editor below. findMinComplexity has the following parameters: int complexity[n]: the order and complexity of the lectures int days: the number of days the conference is being held Returns int: the minimum overall complexity level that can be achieved

please use Python to solve the problem