Maximize Optional Tasks

Problem Statement

Maximize Optional Tasks Problem Description In managing tasks at analytics platform, the goal is to efficiently schedule both required and optional tasks within specified time constraints. There are n required tasks and n optional tasks. Two arrays, requiredTaskTimes and optionalTaskTimes , provide information on task hours, where requiredTaskTimes[i] represents the duration in hours of the i th required task, and optionalTaskTimes[i] represents the duration in hours of the i th optional task. Each day on the platform has a time limit denoted as dailyTimeLimit in hours. One required task must be scheduled each day. If time remains after the required task you can choose to schedule at most one optional task on that day. It's essential to ensure that the total hours does not exceed the specified dailyTimeLimit . Determine the maximum number of optional tasks that can be scheduled during these n days while adhering to the given constraints. Function Description Complete the function maxim