Combining Arrays

The merge algorithm takes two sorted arrays from least to greatest, one with n elements and the other with m elements, and produces a third array of length n $+$ m also sorted in this same order. You are asked to create a version in C that runs in O$($n$)$ time.

The prototype of the function is:

void merge$($int a$[],$ size$\_$t n$,$ int b$[],$ size$\_$t m$,$ int c$[])$; In this function, arrays a of n elements and b of m elements are the inputs. Array c is the output. Assume that there is enough space in c to copy the n $+$ m elements.

As an example, if we have: a $=[5,7,12,16]$; n $=4$;

b $=[1,3,6,9,11,15,17,18]$; m $=8$ The result of c would be: c $=[1,3,5,6,7,9,11,12,15,16,17,18]$;