Use the methods for stacks and queues developed in the course to write the following function: "Use a local Queue to reverse the order of all the entries in a Stack". In writing your function, be sure to check for empty and full structures as appropriate. Your function may declare other, local structures as needed.

void reverse(stack *s)
{
    queue q;
    element e;
    
    q=CreateQueue();
    while(Top(*s,&e) && EnQueue(&q,e) && Pop(s));
    while(Front(q,&e) && Push(s,e) && DeQueue(&q));
}