Handwrite parallelized sort

Create a sorting algorithm that uses parallel workers to arrange the input numbers in ascending order. Treat workers as logical workers; actual threads or processes are not required. Divide nums into at most num_workers portions as evenly as possible, have each worker sort its portion independently, and combine the sorted portions by repeatedly merging them until one sorted list remains. Example The workers can sort portions of the list concurrently before the ordered…