Given an integer array of size n denoted AO...n-1), the prefix sum problems involve computing another integer array B, also of size n, satisfying the following property: Vi: 0: name of the text file that contains n integers representing the input array A Zoutput-file 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: name of the text file that contains n integers representing the input array A Zoutput-file 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<.><.>