Write a program which should implement All four cases as mentioned in section using doubly link list data structure. Case 1: Insert at the start of the queue Case 2: Delete from the start of queue Case 3: Insert at the end of the queue Case 4: Delete from the end of queue note : ALL CODE IN C++(must contain doubly linklist) WITH PROPER SNAP SHOT'S