Please rewrite the Prefix sum algorithm (in C++) to make it parallel on P processors. What would the work, width, and critical path of its parallel task graph be?

TY in advance!!

Edit: Prefix Sum Algorithm included for clarity (rewrite this to include parallelismI:

// C++ program for Implementing // prefix sum array #include using namespace std;

// Fills prefix sum array void fillPrefixSum(int arr[], int n, int prefixSum[]) { prefixSum[0] = arr[0];

// Adding present element // with previous element for (int i = 1; i

// Driver Code int main() { int arr[] = { 10, 4, 16, 20 }; int n = sizeof(arr) / sizeof(arr[0]); int prefixSum[n];

fillPrefixSum(arr, n, prefixSum); for (int i = 0; i

2 Prefix sum Prefixsum is an algorithm that has many uses in parallel computing. The algorithm computes pr[i] Eisi arr[j], Vo si sn and is often written sequentially: void prefixsum (int* arr, int n, int* pr) { pr [0] = 0; for (int i=0; i