Develop a parallel algorithm to compute the number of elements in the union on n sets A1,A2....An. We assume that there are p process, and each process is assigned n/p sets in the beginning. Let m be the size of largest set.

For example,A1={2,7},A2={3,5,8},A4={1,5}, and A4={2}.we have their union A1 u A2 u A3 u A4 to be {1,2,3,5,7,8},which has 6 elements. The parameter m in the example is 3 since A2 is the largest set with 3 elements