1. Provide a parallel pseudocode to the following serial solution that searches for the largest number in an array A. Assume there are p cores and the size of A is n (>>p). Your parallel solution should ensure balanced workload and minimum communication cost whenever possible and the core 0 will eventually have the largest number.

ALGORITHM FindLargestSerial (A[0..n-1]) // Input: An array A[0..n-1] of n orderable elements // Output: The largest element in A[0..n-1] largest = A[0]; for (i = 0; i