Multithreaded Array Sort

Problem Given an integer array nums with length n and an integer k representing the number of worker threads, produce an ascendingly sorted array containing every element from nums. Your approach must satisfy all of the following requirements: Split nums into exactly k segments whose sizes are as equal as possible, assigning one segment to each thread. The threads must run in parallel, and no thread may access elements outside its own segment. A thread may read and write…