Help!!! *In Java language* Due tonight!! Thx!!!!

CSCI 2315 Data Structures Student Name ICE Stacks and Queues (50 points) Instructions: Students will start this exercise in class, 12 October 2017 and will turn in the har This assignment will be posted, but not be submitted on Blackboard. The assignment should be handwritten and clearly reflect your solutions: to include drawings, if applicableecessary at the inning of class, Thursday, 19 October 2017 :Illustrate by drawing the implementation of what happens if the front or rear advances past the last arra! position (it is reset to the first array position) How would you code this event? 2. Draw a sorted gueue (linked List or Array) with five elements (assume no repeats) Label the First and Last elements so they have identical element values. What is the size of the queue? 3. Write the code for a singly-1inked list that supports the following: (Please note which examples would be more/less efficient with an array implementation) a. accessing the element value in the current position b. insertion after the current position