$12\mathrm{.}6\mathrm{.}5$: Produce a version of merge$\_$sort that uses the merge function.

Exit full screen

Rearrange the following lines of code to produce a version of merge$\_$sort that uses the merge function of the preceding exercise.main.cpp

#include $$vector$>$

using namespace std;

vectori$1=0i2=0=\{4,7,2,6,8,34,2\}=n(a[i1]$

$\{$

result.$pus{h}_b$ack$(a[i1])$; $i1++$;

$\}$

else

$\{$

result.$pus{h}_b$ack$(b[i2])$; $i2t+$;

$\}$

$\}$

while size$())$

$\{$

result.$pus{h}_b$ack$(a[i1])$; $i1++$;

$\}$

while size$())$

$\{$

result.$pus{h}_b$ack$(b[i2])$; $i2t+$;

$\}$

return result;