Write a function that merges two sorted dynamic allocated array $($DAA$),$ producing a new sorted DAA. Keep an index into each DAA, indicating how much of it has been processed already. Each time, append the smallest unprocessed element from either DAA, then advance the index. For example,

if array a is

$14916$

and array b is

$479911$

then merge$\_$sorted returns a new DAA,

$14479991116$

int$*$ merge$\_$sorted$($int$*$ a$,$ int n$,$ int$*$ b$,$ int m$)$

Note: you must use dynamically allocated array $($DAA$)$ to get credits for this problem. in c$++$