data structures using void output_deque(int optiondo printf("output restricted deque")printf("\ insert at right")printf("\ insert at left")printf("\ delete from left")printf("\ display")printf("\ quit")printf("\ enter your option ")scanf("% ",&option)switch(optioncase insert_right()breakcase insert_left()breakcase delete_left()breakcase display()break}while(option!= )void insert_right(int valprintf("\ enter the value to be added:")scanf("% "&val)if((left = &right =max- |(left =right+ )printf("\ overflow")returnif (left =- /if queue is initially empty *left right else if(right =max- /*right is at last position of queue *right else right right+ deque[rightval void insert_left(int valprintf("\ enter the value to be added:")scanf("% "&val)if((left = &right =max- |(left =right+ )printf("\ overflow")return