(Choose 1 answer)
Specify the correct implementation of dequeue() method of a queue. This queue uses java.util.LinkedList for storing data and the head of the list is treated as the head of the queue. (Choose the most suitable one)
A. Object dequeue(){ if (isEmpty()) return(null);return(pool.removeFirst());
}
B. void dequeue(Object x){ if (isEmpty()) return(null);pool.remove(pool.size()-1);
}
C. Object dequeue(){if (isEmpty()) return;return(pool.remove(pool.size()-1));
}
D. Object dequeue(){ if (isEmpty()) return(null);return(pool.removeLast());
}
vato
fini
25