Define queues; in what ways can a queue be implemented?
A queue is a linear data structure in which the first element is inserted from one end called the REAR end (also called the tail end) and the deletion of the element takes place from the other end called the FRONT end (also called the head). Each type of queue can be implemented in two ways:
1. Array Representation (Static Representation)
2. Linked List Representation (Dynamic Representation)