Write a complete program to implement a double-ended priority queue using an interval heap, all operations like insertion and deletion of min, and max elements at different levels with display, Examine nodes bottom to top. Swap endpoints in the current root if needed. Reinsert the right endpoint into a max heap. Reinsert the left endpoint into the min heap.

please provide a complete code along screenshots and outputs