Populate a queue with a list of integers (both positive and negative) from a file (input.txt). Write an algorithm that deletes all negative integers without changing the order of the remaining elements.

At the end, you will end up with a queue that will contain only positive numbers, in the order in which they were entered.

Requriements:

Duplicates are allowed.

Do not use a counter to keep track of the number of items in the queue.

Do not create any other data structures such as stacks, other queues, linked lists or arrays.

You can only use the enqueue and dequeue functions when modifying the queue.

Display the results on the screen by using a traverse function.