$12\mathrm{.}6\mathrm{.}4$: Write a function that merges two previously sorted vectors, and returns the merged version.

Full screen

The implementation of the merge function used by merge$\_$sort merges adjacent ranges contained in a single array. Rearrange the following lines of code to implement a different approach. Instead of receiving a single array, write a function that merges two previously sorted vectors, and returns the merged version.Unused

$\{$ result.push$\_$back$($b$[$i$2])$; i$2++$;

$\}$

while $($il $$ a$.$size$()$ && i$2$ b$.$size$())$

$\{$

$\}$

while $($i$2$ b$.$size$())$

$\{$

result.push$\_$back$($b$[$i$2])$; i$2$t$+$;

$\}$

vectori$1=0i2=0a=\{32,71,12,45,2\}b=\{27,91,2,53,64\}c=$merge$(a,b)nn$