#include iostream using namespace std; void print data int s, int k) for (int j 0; j k j++) cout s[j] cout endl void print data reverse int s, int j) if(j e) return else f cout s il print data reverse (s, j-1); int main() int stack 100]; int n; int data cout nter the size of your stack cin n; court nter possible data for your stack for (int i 0; i k n; i++) cin data; stack i data