PRACTICE TASKS Task 1: Using Linked List (Java Code) You will create a program using the concept of Circular queue where the items stored are characters. The maximum size of the droular queue is 5. (QUEUE_CAPACITY =5 )) Program will have a menu with three options: (Display of Menu: 1 points) 1. Enter Character 2. Display all items 3. Exit Given is the list or characters to be processed trom lert to right. Sample numbers: R,C,G,C,A,E,C,N,J (Explanation: when the characters are R, C, G, Ci you insert each of these characters in queve. When the character is A (consonant) then dont irsert that in the queve rather you delete the front item R and this process continues) Basic operations to be used. (Use of these functions: 3 points) Sample Output: Sample items entered R,C,G,C,A,E,C,N, and J R-.. Inserted C... Inserted G Inserted C-... inserted R ... Deleted C... Deleted N... Inserted Could not be inserted - queue is full