Code Question 2

Problem Statement

Problem Description You are managing an Amazon fulfilment centre. There are n customer orders waiting, and every order has to be prepared and dispatched. Two systems are available: Automated robotics system. The robots work on every order they are given at the same time (in parallel), so the robots finish when their slowest assigned order finishes. Order i costs the robots robotTime[i] units of time. Human workforce. The team works on its orders one after another (sequentially), so the team finishes after the sum of the times of all the orders it was given. Order i costs the team humanTime[i] units of time. Every order must be processed entirely by one of the two systems, never split between them. Either system may end up with no orders at all. Both systems start at time 0 and work at the same time as each other, so the whole batch is done at total time = max( largest robotTime among the robot orders , sum of humanTime over the human orders ) where an empty group contributes 0. Choose