 The first consists of many recursive calls that repeatedly perform the same division process until the subsequences are trivially sorted (containing one or no element).An intuitive approach is the parallelization of those recursive calls.Following pseudocode describes the merge sort with parallel recursion using the fork and join keywords