Help!! In java language please!!! NOT in C language!!!! Thx!!!

1. Referencing an Array implementation of a Queue; Illustrate by drawing the implementation of what happens if the front or rear advances past the last array position (it is reset to the first array position). How would you code this event? 2. Draw a sorted queue 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-linked list that supports the following: (Note which would be more efficient in an array implementation) a. accessing the element value in the current position b. insertion after the current position CSCI 2315 Data Structures Page 2 of 3 c. moving to the position immediately prior to the current position d. moving to the position immediately following the current position 4. Which statement inserts a new item x after position current? Ilustrate. a. c ListNode(x, current); b. current = new ListNode(x, current.next) c. current.next-new ListNode(x, current); d. current .next = new ListNode(x, current.next); 5. If a header node is used, write the code that indicates (true) a list with one item and illustrate. 6. Write the condition, if true, guarantees that a doubly linked list with head and tail nodes is empty? 7. Illustrate the insertion of a node into a doubly linked list