The sum of prefixes is a very important operation in parallel programming, as it is often a step in other more complex algorithms. The operation, called “scan” in several code libraries, is applied to a vector, and consists of calculating, for each element of the vector, the sum of all the elements that precede it. This sum may or may not include the element itself, when it does, we say that it is an inclusive sum, when not an exclusive sum. One way to make the algorithm parallel is similar to the parallel reduction algorithm , and can be expressed by the following image

In the image above we see a parallelization scheme for the sum of prefixes of a 16-element vector, divided into steps, where in the 1st step each element is added to the nearest subsequent neighbor, in the 2nd step each element is added to the second subsequent neighbor nearest, etc. Develop a parallel program in OpenMP to perform inclusive prefix sum. Your program should calculate and output the sum of prefixes of two 16-position vectors, one with all elements equal to 1, and one with elements representing the natural numbers 1 through 16.