For parallel programming

QUESTION 12 2 points Save Answer The central counter implementation of the barrier routine has time complexity (where P is the number of processes): O B. O(logP) C. OPlogP) O D.O(P) QUESTION 13 2 points Save Answer Assume each process in a group of processes holds a row of the matrix in process rank order, i.e., row i of the matrix is held my process i. If we want to use a single MPI routine to transpose the matrix across the processes, i.e., elements on each row are distributed across the process with element i sent to process i, and after data exchange, each process holds one column of the matrix with column i resides on process i, which MPl routine is capable for doing this? A. MPI Alltoall B. MPI Scatter O C. MPI Gather O D. MPI Reduce QUESTION 14 2 points Save Answer Fill in the missing key word at the beginning of the following code segment such that n instances of the statements of the body can be executed simultaneously. (i = 0 i<:>