Data structures

in java only not c++

please only answer the queue based array implementation questions in java and give me the full code with a main method so i can get an output.

Lab 5 --Student- Queve How do we implement a circular array Create an arry of stee 10 and fill it with numbers from 1 to 10 insert values in the anay T trom 1 to 3214 in a circular way beginning from index 0 . what is the content of the array T ? Queve based Array implementation 1. The abstract data type Dueuv Z. The Queve class leport fava-lang-reflect, Array; putide class Queaeets inplesents GuesedgTCE)( prlvate int sire, frost, caarh prluate E data[]; fmalif queue(claisces wlenent, 1mt chie) ] pullife boolean MiEnqtyr(If R/Tubu ] privace boolean fulli() ( (rTaDe ] frotile void encoune( E= f 1/2 Lats Oues-shudart.mel 1025cin1 The output shauld be: f/TeCin 4. Foverse a queue How to reverse the content of a queue using a stack Quve Integers Q - new Q-wueca(Integer-class, 5); Stacke Intwger) 5 - now Stacke)(): far ( int 1=1,ic=0;1+1)} Q.enqueve (1)] 1 Vridenerside the quat frTenc