Company: Amazon_july
Difficulty: medium
Process Synchronization Problem Description A team of developers at Amazon is working on process synchronization. One way to achieve process synchronization is through effective inter-process communication. Processes can communicate with each other through shared memory, i.e., by accessing the same resources while executing simultaneously. A set of processes is synchronized if there is at least one process in the set whose execution time overlaps with the execution times of all other processes in the set. Given the starting and ending times of execution of n processes in the arrays starts and ends respectively, determine the minimum number of processes that must be dropped so the remaining processes form a synchronized set. Note: A set containing only one process is considered to be synchronized. Function Description Complete the function findMinimumProcessDrops in the editor below. findMinimumProcessDrops has the following parameters: int starts[n] : process execution start times int