please i only need perfect code its so important for my assignment so please consider my request and only send the code if possible please send explanation

Develop a parallel code for the following problems using OpenMP. Report the speedup of your implementations by varying the number of threads from 1 to 16 (i.e., 1,2,4,6,8,10,12,14, and 16). Use gettimeofday() for calculating runtime and consider the average of 5 runs. Draw appropriate graphs using gnuplot. (- Generate 4107 numbers using a Uniform Random Number Generator and store the numbers in an array from A[0] to A[41071]. Sort the array using Merge Sort Technique by considering bottom-up approach. Solve the problem for different data types (i.e., int, float, and double). Place N-Queens on the NN chessboard in non-attackable positions, N{10,12,14,16}. Record all the solutions