With the concepts of Queue Data Structure, write the functions performing the following tasks: 1. Insertion of an element in the Queue i.e. enqueue() 2. Deletion of an Element from the Queue i.e....

Extracted text: With the concepts of Queue Data Structure, write the functions performing the following tasks: 1. Insertion of an element in the Queue i.e. enqueue() 2. Deletion of an Element from the Queue i.e. dequeue() 3. Display All Elements in the Queue i.e. dispqueue() 4. Display the Element at the Front i.e. dispfront() 5. enqueue() the Queue with the elements in ascending order. After that, use the above four functions to display the same elements in the Queue in descending order.