Given two sorted arrays a and b, each with lengths m and n respectively, write a function to return the union of the two arrays while preserving duplicate values. You may assume that the first array, a, has size equal to m + n, meaning it has enough space to hold additional elements from array b....