For this Question: You are given an array and Q queries. Your task is to perform these operations:-

enqueue: this operation will add an element to your current queue.

dequeue: this operation will delete the element from the starting of the queue

displayfront: this operation will print the element presented at the frontUser task:
Since this will be a functional problem, you don't have to take input. You just have to complete the functions:
 <b>enqueue()</b>:- that takes the integer to be added and the maximum size of array as parameter.
 <b>dequeue()</b>:-   that takes the queue as parameter.
 <b>displayfront()</b> :-   that takes the queue as parameter.

Constraints:
1 <= Q(Number of queries) <= 10<sup>3</sup>

<b> Custom Input:</b>
First line of input should contains two integer number of queries Q and the size of the array N. Next Q lines contains any of the  given three operations:-
enqueue x
dequeue
displayfrontDuring a dequeue operation if queue is empty you need to print "Queue is empty", during enqueue operation if the maximum size of array is reached you need to print "Queue is full" and during displayfront operation you need to print the element which is at the front and if the queue is empty you need to print "Queue is empty".

Note:-Each msg or element is to be printed on a new line
Sample Input:-
8 2
displayfront
enqueue 2
displayfront
enqueue 4
displayfront
dequeue
displayfront
enqueue 5

Sample Output:-
Queue is empty
2
2
4
Queue is full

Explanation:-here size of given array is 2 so when last enqueue operation  perfomed the array was already full so we display the msg "Queue is full".

Sample input:
5 5
enqueue 4
enqueue 5
displayfront
dequeue
displayfront

Sample output:-
4
5, I have written this Solution Code:     public static void enqueue(int x,int k) 
    { 
        if (rear >= k) { 
            System.out.println("Queue is full"); 
          
        } 
        else { 
         a[rear] = x; 
            rear++;
            
        } 
    } 
  
   public static  void dequeue() 
    { 
        if (rear <= front) { 
            System.out.println("Queue is empty"); 
            
        } 
        else { 
            front++; 
            
        } 
    } 
  
public  static    void displayfront() 
    { 
        if (rear<=front) { 
            System.out.println("Queue is empty"); 
            
        } 
        else { 
            int x = a[front]; 
            System.out.println(x);
            
        } 
    } 
}, In this Programming Language: Java, Now tell me if this Code is compilable or not?