Processor Deployment Optimization

Problem Statement

Processor Deployment Optimization A supercomputer has several processors to deploy for execution. They are arranged sequentially in a row from 1 to n. The efficiency of each processor depends upon the order of deployment of its adjacent processors. For the i th processor, the efficiency of the i th processor is: no_adjacent[i] when neither one or both adjacent processors is deployed before processor i one_adjacent[i] when exactly one adjacent processor is deployed before processor i both_adjacent[i] when both adjacent processors are deployed before processor i Note: The 1 st and n th processors can only have one adjacent. Find the maximum possible sum of efficiencies among all possible orders of deployment. Function Description Complete the function getMaximumSum in the editor below. getMaximumSum has the following parameters: int no_adjacent[] : an array of integers int one_adjacent[] : an array of integers int both_adjacent[] : an array of integers Returns long_int : the maximum poss