Use C programming language only and  GET THE OUTPUT AS SHOWN IN THE "EXAMPLE".

Question 2 Incorrect Marked out of 5 Flag question Circular Double Linked List implementation of List ADT Create Circular Double Linked list using structures. First Element of the Circular Double Linked List must have header. Each node in the Circular Double Linked list must contain three part (one data and two pointers). one part must data with integer data type and one pointer refers previous node and another pointer refers next node structure. First node of list refers last node and last node of list refers first node. Display Middle element of list. if the list is empty display "List is Empty". Note: ****Do not use counter variable to find the middle element.**** Input: Enter number of elements N Enter the element to be inserted. Output: Display the list and middle of the list. For example: Test Input 1 2 3 4 4 10 20 40 50 5 10 20 30 40 50 Middle element is 30 2 25 45 Result 1 1 List 10 20 30 40 50 List List 10 20 40 50 List Middle element is 20. List 25 45 List Middle element is 25 List 1 List Middle element is 1