WRITE IN C not c$++$

Part $-|$ : Priority Queue $($Points: $2\mathrm{.}5)$

Students are to implement a priority queue using $C$ language

Ask user for number of elements for the Priority Queue $($as in fig $1)$

User input elements and their Priority

Display elements with their Priority

Ask use for Dequeue.

If user input dequeue, the element with highest priority should be

removed from the existing list and then display the new list.

$5$ is the highest priority, $1$ is the lowest priority for a process

Students can use any data structure to implement the Priority QueueEnter P$-$Queue Length $=3$

Enter element $1$: $2$

Enter priority of element $1$: $0$

$*$nter element $2$: $2$

Enter priority of element $2$: $4$

Enter element $3$: $15$

Enter priority of element $3$: $2$

$----$Priority Queue Full$------$

Priority Queue Before Dequeue :

$($Element: $2,$ Priority: $0)$

$($Element: $2,$ Priority: $4)$

$($Element: $15,$ Priority: $2)$

Dequeue $(1$ for yes, $0$ for exit$)$: $1$

priority Queue After Dequeue :

$($Element: $2,$ Priority: $0)$

$($Element: $15,$ Priority: $2)$

Dequeue $(1$ for yes, $0$ for exit$)$: $0$Fig $1.$ Expected output