Question in data structure

[Bassam300]

Using the static structures write a program to represent calling of recursive functions in the next program

f1(int);

int main()
{
  f1(6);
  retrun 0;
}
f1(int y)
{
  if(y == 0)
    return 0;
  else
    f1(y-1);
    cout << y;
}

I did not understand the question a good understanding

so I answered him this way

Is it correct or not?

And if not

Please explain me the question!

#include <stack>
#include <iostream>

using namespace std;

stack<int> myStack;

int add2stack(int array[], int size);

int main()
{
    int array[] = {6, 5, 4, 3, 2, 1};

    add2stack(array, 5);

    while(!myStack.empty())
    {
        cout << myStack.top() << " ";
        myStack.pop();
    }
    return 0;
}

int add2stack(int array[], int size)
{
    if(size < 0)
        return 0;

    else
    {
        myStack.push(array[size]);
        return add2stack(array, size - 1);
    }
}