a)Find the speedups and efficiencies of the parallel odd-even sort. Does the program obtain linear speedups? Is it scalable? Is it strongly scalable? Is it weakly scalable?
b)Modify the trapezoidal rule so that it will correctly estimate the integral even if comm sz doesn't evenly divide n. (You can still assume that n comm sz.)
Required minimum 2 page