java

Add code to the Queue code posted to implement circular and priority queue. Add your comments based on the assumptions you have made. Submit the code in word document. Queue A public class Queue \{ int capacity;/lamount of data int size;//size is current number of elements in queue int] data; int front;//first element in queue in order and used only for delete int rear;// last index of array Queue(int max) \{ capacity =max; data=new int[max]; front =0; rear =1;// rear =0; size =0; \} Iladd, remove, read void addData(int val)//add data to queue is call enqueue \{ I/always check if queue has space or not if(size= val; size++; \} else \{ System.out.println("Queue is full"); \} \} I/remove the data - dequeue int removeData() \{ if ( size >0)// checking if queue is empty or not \{ size-; return data[front++]; \} else \{ System.out.println("Queue is empty"); return 1;/ queue can only hold positive values \} \} I/read the data 3