//DLL-workout 1
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <ctype.h>
struct Node 
{
    char task[101];
    struct Node *prev;
    struct Node *next;
};
struct Node *createNode(char *task) 
{
    struct Node* newNode=(struct Node *)malloc(sizeof(struct Node));
    strcpy(newNode->task,task);
    newNode->prev=NULL;
    newNode->next=NULL;
    return newNode;
}
struct Node *deleteFirst(struct Node *head) 
{
    if(head==NULL) 
        return NULL;
    struct Node *temp=head;
    head=head->next;
    if(head!=NULL) 
    {
        head->pr