Minimum Time to Execute Processes

Problem Statement

Minimum Time to Execute Processes Problem Description There are n processes to be executed, each with a specific size given by processSize[i] for 0 <= i < n . Additionally, there are m processors, each with a different size given by capacity[j] for 0 <= j < m . A processor can execute a task in 1 second if the task size is less than or equal to its capacity; otherwise, it cannot execute the task. A processor can execute multiple processes one after the other, but needs to pause for 1 second after completing each one. Multiple processors can work on different tasks simultaneously. Determine the minimum time required to execute all the processes, or return -1 if it is not possible to execute them all. Complete the function getMinimumTime in the editor with the following parameters: int processSize[n]: the size of each process int capacity[m]: the capacity of each processor Returns: int: the minimum time required to execute all the processes, or -1 if there is no way to execut