We can highlight the following characteristics between Stacks and Queues: I. Stacks and Queues are data structures with dynamic memory allocation,...

We can highlight the following characteristics between Stacks and Queues:

I. Stacks and Queues are data structures with dynamic memory allocation, they are Linked Lists.

II. By implementing mechanisms for inserting and removing elements from the Linked List, it is possible to define whether the List behaves as a Queue or as a Stack.

III. Both a Stack and a Queue can be implemented using a Linked List or an Array.

IV. While the Queue follows the FIFO principle, a Stack is manipulated by the LIFO principle.

Analyze the statements and choose the correct alternative regarding the statements:

I. Stacks and Queues are data structures with dynamic memory allocation, they are Linked Lists.
II. By implementing mechanisms for inserting and removing elements from the Linked List, it is possible to define whether the List behaves as a Queue or as a Stack.
III. Both a Stack and a Queue can be implemented using a Linked List or an Array.
IV. While the Queue follows the FIFO principle, a Stack is manipulated by the LIFO principle.
Only statement I is correct.
Only statements II and III are correct.
Only statements II and IV are correct.
Only statements I, III, and IV are correct.
All statements I, II, III, and IV are correct.