a. Develop a divide-and-conquer algorithm to perform a parallel merge sort of an array. Hint: After division, each process sorts its part of the array using an efficient algorithm. Then, the subarrays are merged into larger sorted subarrays.
b. Analyze the communication and computation times if the number of pro cesses is equal to the number of array elements, n.
c. Repeat Part b if the number of processes is less than the number of array elements. Assume that the computation time for the sequential sorting algorithm employed is proportional to m log(m), where m is the number of elements being sorted.