integers $m$ and $n,$ representing the number of elements in $n$

Merge nums $1$ and nums $2$ into a single array sorted in non$-$d

The final sorted array should not be returned by the function, array nums$1.$ To accommodate this, nums $1$ has a length of $m$ denote the elements that should be merged, and the last $n$ ele be ignored. nums $2$ has a length of $n.$

Example $1$:

Input: fluts $1=\{1,2,3,0,0,0\},m=3,$ nums $2=$

Output: $1,2,2,3,5,6$