There are some processes that need to be executed. amount of a load that process causes on a server that runs it, is being represented by a single integer. total load caused on a server is the sum of the loads of all the processes that run on that server. you have at your disposal two servers, on which mentioned processes can be run. your goal is to distribute given processes between those two servers in the way that, absolute difference of their loads will be minimized. write a function that, given an array a of n integers, of which represents loads caused by successive processes, the function should return the minimum absolute difference of server loads.

When making changes to optimize part of a processor, it is often the case that speeding up one type of instruction comes at the cost of slowing down something else. for example, if we put in a complicated fast floating-point unit, that takes space, and something might have to be moved farther away from the middle to accommodate it, adding an extra cycle in delay to reach that unit. the basic amdahl's law equation does not take into account this trade-off. a. if the new fast floating-point unit speeds up floating-point operations by, on average, 2ă—, and floating-point operations take 20% of the original program's execution time, what is the overall speedup (ignoring the penalty to any other instructions)? b. now assume that speeding up the floating-point unit slowed down data cache accesses, resulting in a 1.5ă— slowdown (or 2/3 speedup). data cache accesses consume 10% of the execution time. what is the overall speedup now? c. after implementing the new floating-point operations, what percentage of execution time is spent on floating-point operations? what percentage is spent on data cache accesses?