java

please I need only the ans and the comments on the code

please dont bring any copy from another ans from chegg

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. public class Queue \& int capacity /llamount of data int size,//size is current number of elements in queue int] data; int front, / /first element in queve in order and used only for delete int rear,/l last index of array Queue(int max) \{ capacity=max; data=new intimax]; front =0; rear =1;// rear =0; size =0; \} Iladd, remove, read void addData(int val)//add data to queue is call enqueue f llalways check if queue has space or not if(size0)//checking if queue is empty or not \{ size-: retum data[front++]; 1 else \{ System out printin("Queue is empty"); return - 1.//queue can only hold positive values \} int rear,// last index of array Queue(int max) I capacity=max, data=new int[max]; front =0; rear =1;// rear =0; size =0, ) lladd, remove, read void addData(int val)//add data to queue is call enqueve f I/always check if queue has space or not if(size>0)// checking if queue is empty or not \{ size-: return data[front ++1 : \} else \{ System. out. printin("Queve is empty"); return -1://queue can only hold positive values ) 3 I/read the data 3