You are given a LinkedList, a, which has already been filled with n items. The number of items is guaranteed to be an even number greater than 2. We wish to remove every other item. java. util. Iterator irla. i terater();
whileitr basNex() {
itr, next()
itr, next()
itr, remove
What is the big 0 cost of the following method in the worst case?
a. O(1).
b. O(2^N).
c. O(logN).
d. O(N).
e. O(N^2).