If an array is used for the implementation with first element in the queue always stored in index 0 of the array, in the enqueue operation the itemCount  1) is updated to (itemCount+1) % ARRAY_SIZE 2)does not change 3)is updated to (itemCount-1) % ARRAY_SIZE 4) is updated to (itemCoun -1) 5) is updated to (itemCount +1)

print the even numbers followed by ödd oh Ex4) Given the file pointerlmofQueue.java then write a main method: to - add some elements into the queue, - reverse the queue contents, (Hint use an array) - print the queue contents.

Given a stack, a function is consecutive takes a stack as a parameter and thatreturns whether or not the stack contains a sequence of consecutive integersstarting from the bottom of the stack (returning true if it does, returningfalse if it does not). For example:bottom [3, 4, 5, 6, 7] topThen the call of is_consecutive(s) should return true.bottom [3, 4, 6, 7] topThen the call of is_consecutive(s) should return false.bottom [3, 2, 1] top The function should return false due to reverse order. Note: There are 2 solutions:first_is_conse cutive: it uses a single stack as auxiliary storagesecond_is_cons ecutive: it uses a single queue as auxiliary storage

Simple JAVA linkedlist code implementation please help and complete any part you can - Without using the java collections interface (ie do not import java.util.List,LinkedList, Stack, Queue...)- Create an implementation of LinkedList interface- For the implementation create a tester to verify the implementation of thatdata structure performs as expected Build Bus Route – Linked List- Your task is to:o Implement the LinkedList interface (fill out the implementation shell)o Put your implementation through its paces by exercising each of themethods in the test harnesso Create a client (a class with a main) ‘BusClient’ which builds a busroute by performing the following operations on your linked list:o§ Create (insert) 4 stations§ List the stations§ Check if a station is in the list (print result)• Check for a station that exists, and onethat doesn’t§ Remove a station§ List the stations§ Add a station before another station§ List the stations§ Add a station after another station§ Print the…

Java: Which of the following operations has the least running time in a Queue (assume that only Queue interface operations are available; some operations may require use of an additional temporary  queue)? Multiple choice. Deleting the element at the rear of the queue Checking if an element x is present in the queue Finding the number of elements in the queue all of the above have identical worst case running time