:)

int dequeue(Queue *Q){
    int val;
    // check if empty
    if(Q->front == -1){
        return -1;
    }

    val = Q->q[Q->front];

    // check if one item inside
    if(Q->front == Q->rear){
        Q->front = Q->rear = -1;
    }
    // basic case
    else{
        Q->front++;
    }

    //return the value 
    return val; 
}