In Java code please

Part 2. Solving using a Queue and its inbuilt methods (10 points): Implement the following using Queue in the same Java program as in Part I. a) Create a Queue and add the following ID numbers: i. 14788 ii. 10652 iii. 13764 iv. 12785 v. 10325 vi. 11008 b) Display the Queue using any one of the three cursors (Enumeration, Iterator or ListIterator) c) Ask the user to enter a new ID number and add to Queue and display it. d) Remove only the head element of the Queue and display the removed element. e) Display only the current head element of the Queue. f) Display all the elements present in the Queue. g) Ask the user to enter a valid index number within the size range of the Queue. h) Receive the user input and display the element present at the given index. i) Ask the user to enter an ID number of their choice. j) Search for user given ID number in the Queue and display "ID number is present" if it is present in the Queue or display "ID number is present" if it is not present in the Queue