The normal mergeSort algorithm splits an array into two halves and mergeSorts each half. Then, it takes those two sorted halves and merges them together. This focuses on the part of the algorithm that merges two already sorted arrays into one big array. Given two sorted arrays of ints, return an array that merges these two arrays together into one sorted array. Arrays need not be the same length, and either or both arrays could be empty.