a) Design a parallel algorithm to solve the same problem. Assume that a and n are in local memory for each core when the algorithm starts. Each core also has a local variables p and my_id, where p is the number of cores and my_id is the core's unique identifier (0 ALGORITHM FindLargest input: aan array of real numbers n the number of values in the array output: largest the largest value in a : largest a[0] for i in 1 .. n-1: if a[i] largest: largest a[i] return largest