data structures

e Completion This test can be saved and resumed later. estion Completion Status: QUESTION 1 Task 1: Write a Java program to implement a Priority Queue in an office i. Provide the menu as shown below. Run the program in a loop, stop when user opts 4. Fi. Use your own singly linked list of nodes with info requestiD and priority i Add a customer should input priority (0 to 10) from user and enqueue it at proper position in the priority queue iv. Remove a customer should degueue a customer with highest priority Show the queue should display the queue using the method printQueue'). TTT Arial 3 [12pt T-513-5. Pam Click Save and Submit to save and nemt. Click Saves to