Implement a queue using an array with enqueue and dequeue of O(1). Consider a capacity for your queue and implement the following functions:
A) Dequeue() : (returns the top element of the queue and removes it as well)
B) Enqueue(n): inserts value n into the queue
C) IsFull(): True only if the queue is full (based on some agreed capacity)
D) IsEmpty(): True if the queue has no value in it
E) Queue_size() returns the number of elements in the queue