Suppose a$[1$:m$]$ and b$[1$:n$]$ contain sorted elements in non$-$decreasing order. Write an

algorithm "Merge" that merges these items into c$[1$:m$+$n$]$ single sorted sequences in O $($n$)$

time. Is it possible to design an efficient algorithm in comparison to "Merge"? If elements

of array a$[1$:m$]$ are equal, then comment on the algorithm's complexity