10 Point.

• Description: In recursion, a function or method has the ability of calling itself to solve the problem. Write C ++ program that will reverse the order of a stack. You should use stack class and youre NOT allowed to use any C++ loops. You should add precondition and postcondition to get full credit.

(dear expert, you should use the following stack class )

class Stack

{

private:

struct node* head;

public:

stack();

~stack();

void push(double element);

void pop();

double top();

bool isEmpty();

bool isFull();

int numOfElements();

void printElements();

};