Given an integer array of size n denoted A[0 . . . n 1], the prefix sum problems involve computing another integer array B, also of size n, satisfying the following property:

Design a concurrent program that computes the prefix sum of a given array using multiple processes (and not threads) to achieve concurrency. Your program should be named cps and take the following command line arguments as input:

n: size of the input array

: name of the text file that contains n integers representing the input array A

: name of the text file that contains n integers representing the output array B (to be computed by your program)

m: number of processes that will perform the work (degree of concurrency)

If the input file does not contain exactly n integers (separated by white space), then your program should terminate with an appropriate message. Your program should be able to handle the cases when m does not divide n evenly and when m Vi:0