Given two arrays of ints called numsA and numsB, one of the arrays will have values that are guaranteed (this is a precondition) to be less than all of the values in the other array. Find which array has the lesser values, then create and return an array containing all of the lesser-input elements (in the same order they were presented in the input array), followed by all the greater-input elements (again, in the same order). Other precondition: numsA and numsB will each have at least one element. Note that numsA and numsB do not have to be sorted for this algorithm to work!