#include<stdio.h>
#include<stdlib.h>
struct Node
{
    int value;
    struct Node*prev;
    struct Node*Next;
};
struct Node*createNode(int val )
{
    struct Node*NewNode=(struct Node*)malloc(sizeof(struct Node));
    if(NewNode==NULL){
        printf("Invalid input\n");
        exit(1);
    }
    NewNode->value=val;
    NewNode->Next=NULL;
    return NewNode;
}
 void insertEND(struct Node**head,int val)
 {
     struct Node*NewNode=createNode(val);
     if(*head==NULL){
         *head=NewNode;
     }
     else
     {
    struct Node*temp=*head;
    while(temp->Next!=NULL)
    {
        temp=temp->next;
    }
    temp=temp->NewNode;
        
     }
 }
 void firstoccurance(struct Node**head,int val){
     if(head==NULL){
         printf(List is empty);
         return;
     }
     struct Node*currentNode=*head;
     
     
     }
 }