Efficient Scaling

Problem Statement

Efficient Scaling Problem Description A data processing pipeline consists of n services connected in series where the output of service i serves as input to service i+1. Each service has varying latency, and the throughput of the i th service is represented by throughput[i] in messages per minute. Each service can be scaled up independently. Scaling up the i th service one unit of time costs scalingCost[i], and after scaling up x times, the service can process throughput[i] * (1 + x) messages per minute. Given throughput and scalingCost arrays of size n, and a budget value, determine the optimal scaling configuration to maximize the throughput of the final service. Return the maximum throughput possible. Complete the function `getMaximumThroughput` in the editor below. `getMaximumThroughput` has the following parameters: `int throughput[]`: the throughput generated by each of the n services `int scalingCost[]`: the cost of scaling up a service one time `int budget`: the available money