Hello I am stuck on this problem

Can you help me out

Everything is one question and the template is included

Can you make the program work

So I can show my colleagues how is done

Not 3 of us could figure it out lol

Please code simple as possible

Lab for Chapter 5 -Pipelined Insertion Sort This is the lab exercise for Chapter 5-Pipelined Computation. The task is to implement pipelined insertion sort using MPI. The guidelines for the implementation include the following: 1. Use one process to implement one function unit in the pipeline. Communications between processes must follow the pipeline structure, i.e., process i only communicates with process i-1 and process i+1 where Ocixp-1, process O only communicates with process 1 and process p-1 only communicates with process p-2, etc Use the master process, Process 0, to generate random numbers to sort and start the sorting process. The number of numbers to sort should be equal to the number of processes. Process 0 should use a dynamically allocated array to store generated numbers. Process O prints the generated numbers before the sorting starts. After sorting, numbers must be transferred back to Process O using the pipeline structure and Process 0 prints out the sorted numbers. 2. 3. A template of the program is provided. Demonstrate your program in the class