I need DevC++Answer Please!

I NEED DEVC++ PLEASE

{ Task 2: Write a function that takes two queue structures as parameters: original queue and modified queue. The function finds the numbers greater than or equal to 5 in the original queue and places 1 to the same position in the modified queue. For the numbers less than 5.modified queue element has 0. Assume that two input queues have the same number of elements at a time. Example Original Queue: 3 5 16 12 8 Example Modified Queue: 1 0 10 1 void modifyqueue (struct queue org, struct queue mod) { Note that you need printqueue function to display the queue contents in order to verify your solutions