in c$++$ given the defined constant SIZE, of type int, implement the function

void order$($int decks$[][$SIZ$],$ int numDecks, int buffer$[])$:

Each row of decks is assumed to represent a single "deck" l$.$e$.$ a list of values sorted in ascending order. Your function will populate buffer with the entire collection of values arranged in ascending order.

Use the following algorithm $($REQUIRED$)$: Keep track of the current index of each deck, starting with index $0$ for all of them. Among the current indexes, pick the one whose corresponding element has the smallest value. Copy that value to the bufier and increment the corresponding index. Continue until all the indexes have reached SIZE, meaning there are no more values to pick off. At that point all values will have been copied to the buffer in ascending order.

Here's a sample program to test your code:

tinclude eigstrequs?

using namespace std;

const int SIZE$=4$;

const int MAXDECKS $=100$;

void order$($int decks $[$ISIZE$],$ int numDecks, int buffer$[])$ :

void print$($int nums I, int length$)$;