Write a code for the following problem using c++. Please show your output screen.

Exercise P6.6. Write a function vector merge-sorted(vector b) that merges two sorted vectors, producing a new sorted vector. Keep an index into each vector, indicating how much of it has been processed already. Each time, append the smallest unprocessed element from either vector, then advance the index. For example, if a is 1 4 9 16 and b is 47 9 9 11 hen merge_sorted returns the vector 1 4 4 7999 11 16