Answer properly with explanation for thumbs up. Don't copy already answered questions from chegg.

3. Write a MPI program that uses a divide-and-conquer approach to find the first zero in a list of integers stored in an array. Use 16 processes and 256 numbers. Hint shows below: 1. Initially the process is divided in to 16 subprocesses, such that each of the process divides the number into half and sends it to another process. 2. Thus each leaf, has 16 elements as there are 16 processes and 256 numbers. 3. The leaf will check for first zero in its 16 element and will call the parent with the necessary message i.e. the earliest zero element. 4. When parent receives the elements from both the left and right child, if both give the element then it sends the left childs element to upper parent, if only left or right child give the position of zero element, it sends that position up. If no child sends the element, then send the upper parent a message that no zero. 5. Continue step 4 till root is achieved. a Save this program as q3.c. Provide instructions on how to execute your program and clear comments in your coding. (15m)