C program to performs all operations on singly linked listWrite a program that uses functions to perform the following operations on singly linked listi) Creation ii) Insertion  iii) Deletion  iv) TraversalSample Test CasesTest Case 1:Expected Output:Singly·Linked·List·Example·-·All·OperationsOptions1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·1Enter·elements·for·inserting·into·linked·list·:·111Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·1Enter·elements·for·inserting·into·linked·list·:·222Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·1Enter·elements·for·inserting·into·linked·list·:·333Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·1Enter·elements·for·inserting·into·linked·list·:·444Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·3The·elements·in·the·linked·list·are·:·111·222·333·444·Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·2Enter·position·of·the·element·for·deleteing·the·element·:·2Deleted·successfullyOptions1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·3The·elements·in·the·linked·list·are·:·111·333·444·Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·4No·of·elements·in·the·linked·list·are·:·3Options1·:·Insert·elements·into·the·linked·list2·:·Delete·elements·from·the·linked·list3·:·Display·the·elements·in·the·linked·list4·:·Count·the·elements·in·the·linked·list5·:·Exit()Enter·your·option·:·5

#include<stdio.h>
#include<stdlib.h>

struct node {
    int data;
    struct node *next;
}*head;

void insert(int num) {
    struct node *temp;
    temp=(struct node *)malloc(sizeof(struct node));
    temp->data=num;
    if(head == NULL) {
        head=temp;
        head->next=NULL;
    } else {
        temp->next=head;
        head=temp;
    }
}

void delete(int num) {
    struct node *temp, *prev;
    temp=head;
    while(temp!=NULL) {
        if(temp->data==num) {
            if(temp==head) {
                head=temp->next;
                free(temp);
                return;
            } else {
                prev->next=temp->next;
                free(temp);
                return;
            }
        } else {
            prev=temp;
            temp= temp->next;
        }
    }
    printf("\n%d not found in the list\n", num);
}

void display() {
    struct node *temp;
    temp=head;
    while(temp!=NULL) {
        printf("%d ", temp->data);
        temp=temp->next;
    }
}

int count() {
    struct node *temp;
    int count = 0;
    temp=head;
    while(temp!=NULL) {
        count++;
        temp=temp->next;
    }
    return count;
}

int main() {
    int choice, num;
    head=NULL;
    while(1) {
        printf("\nOptions\n1 : Insert into linked list\n2 : Delete from linked list\n3 : Display linked list\n4 : Count linked list\n5 : Exit\nEnter your option : ");
        scanf("%d", &choice);
        switch(choice) {
            case 1: printf("\nEnter the number to insert : ");
                    scanf("%d", &num);
                    insert(num);
                    break;
            case 2: printf("\nEnter the number to delete : ");
                    scanf("%d", &num);
                    delete(num);
                    break;
            case 3: display();
                    break;
            case 4: printf("\nNo of elements in the linked list = %d", count());
                    break;
            case 5: exit(0);
        }
    }
    return 0;
}