Stack as a Linked List

Write a menu driven program to implement stack as a linked list. Assume that the size of the stack is 5.
#include<stdio.h>
#include<stdlib.h>
struct node { 
    int data ;
    struct node * link ;
};
void push(struct node **q,int n){
    struct node *nn;
    nn = (struct node*)malloc(sizeof(struct node));
    nn->data = n;
    if(*q == NULL){
        nn->link = NULL;
        *q = nn;
    }
    
    else{
    nn->link = *q;
    *q = nn;
    }
}
int count (struct node *q){
    struct node *t=q;
    int i=0;
    while(t!=NULL){
        i++;
        t = t->link;
    }
    return i;
} 
void pop(struct node **q){
    if(*q == NULL){
        printf("No element in the stack\n");
    }
    else{
        printf("Element Popped is %d\n",(*q)->data);
        (*q)  = (*q)->link;
    }
}
void display(struct node *q){
    struct node *t = q;
    while(t!=NULL){
        printf("%d ",t->data);
        t = t->link;
    }
}

int main(){
    struct node *s=NULL;int choice,t;
    printf("Choice 1 : To push data\nChoice 2 : To pop data\nChoice 3 : To display\nChoice 4 : To count\n\n");
    do{
    printf("Enter your choice\n");
    scanf("%d",&choice);
    switch(choice){
        case 1:{
            printf("Enter the data to be pushed\n");
            scanf("%d",&t);
            push(&s,t);
            break;
        }
        case 2:{
            pop(&s);
            break;
        }
        case 3:{
            printf("Linked List Contents\n");
            display(s);
            printf("\n");
            break;
        }
        case 4:{
            printf("Number of elements in the linked list is %d\n",count(s));
        }
    }
    }while(choice<=4 && choice!=0);
    printf("END");
    return 0;
}