Analyze the snippet of code below. This snippet of code is using a queue. Identify whether the queue is a regular queue or a priority queue. Explain how the queue behaves when the tail reaches the end of the queue. public vold Enqueue (int newElement) \&. Q[tail] = newt lement; if (head =1 ) head = e; else if (Q[head] \& newElement) t head = tail; ) if ((( tail +1)