In C Programming language

struct MyQUEstructure { int front 1; ROUNDED QUEUE (ARRAY IMPLEMENTATION) int back 5; QUE EMPTY? int counter = 0; If counter =0 then QUE is EMPTY int QUE[5] START = 1 } MAX = 5 QUE FULL? If counter = MAX the QUE IS FULL Position of New Front = Front Mod Max + 1 = ? MOD 10+1=? STATUS QUO / CURRENT STATUS Position of New Back = Back Mod Max + 1 = ? MOD 10 + 1= ? FRONT BACK COUNTER FULL EMPTY 0 1 1 5 0 1 2 3 4 5 Index of Array MyQUE Items Front Back 1. Figure 1 shows a an empty rounded QUEUE. 2. Show Step by Step to insert your own student ID into the Queue. 3. After you insert 6 characters of your ID, show step by step deletion of 4 items from the Queue. 4. Show Step by Step to insertion the remainder student ID which are not inserted yet into the Queue