Develop parallel codes for the following problems using JAVA, 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).$Repeat the experiment fivetimes and consider the average of five runsSorting and Merging Subsequences: You are given a sequence of

$10$power$9$ elements to sort. The input sequence consists of $10$power$3$

subsequences, each of which contains $10$power$6$elements. The elements in

a given subsequence are all smaller than the elements in the

succeeding subsequence and larger than the elements in the preceding

subsequence. Sort the input sequence by varying the number of

threads.