Write a C program to implement priority queue using sorted linked list.Insert a minimum of five elements. Display the priority queue. Remove two elements and display the queue. The input format is: Data followed by Priority valueSample

 Input/OutputInput 25 9 85 6 -89 2 145 4 30 2 -999

Output-89-->2, 30-->2, 145-->4, 85-->6, 25-->9  

After removing two elements: 145-->4 85-->6 25-->9

Test 1: Test case 1--- Input ---25 9 85 6 -89 2 145 4 30 2 -999---

 Expected output (text)----89-->2, 30-->2, 145-->4, 85-->6, 25-->9

After removing two elements: 145-->4 85-->6 25-->9

Test 2: Test case 2--- Input ----99 3 -9 1 23 8 77 2 -999--- Expected output (text)---Insert 5 elements

Test 3: Test case 3--- Input ---99 3 -999--- Expected output (text)---Insert 5 elements

Test 4: Test case 4--- Input ---99 3 123 5 156 9 -999--- Expected output (text)---Insert 5 elements

Test 5: Test case 5--- Input ---68 5 33 1 22 9 6 8 7 2 -99 10 -999--- Expected output (text)---33-->1, 7-->2, 68-->5, 6-->8, 22-->9, -99-->10

After removing two elements: 68-->5 6-->8 22-->9 -99-->10

Test 6: Test case 6--- Input ----100 1 -56 6 -999--- Expected output (text)---Insert 5 elements

Test 7: Test case 7--- Input ----456 9 123 6 12 1 -4 1 -999--- Expected output (text)---Insert 5 elementsTest 8: 

Test case 8--- Input ----25 9 -85 6 -89 2 -145 4 -30 2 -999--- Expected output (text)----89-->2,-30-->2,-145-->4,-85-->6,-25-->9After removing two elements:-145-->4 -85-->6 -25-->9

Test 9: Test case 9--- Input ---89 2 10 1 22 6 7 3 21 7 -999--- Expected output (text)---10-->1, 89-->2, 7-->3, 22-->6, 21-->7

After removing two elements:7-->3 22-->6 21-->7