1. Figure 1shows 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.

struct MyQUEstructure int front 1: ROUNDED QUEUE (ARRAY IMPLEMENTATION) int back S; QUE EMPTY? int counter = 0; If counter - then QUE IS EMPTY int QUES START = 1 MAX = 5 QUE FULL? If counter = MAX the QUE IS FULL Position of New Front = Front Mod Max + 1 = ? MOD 10+1=2 STATUS QUO / CURRENT STATUS Position of New Back = Back Mod Max + 1 = ? MOD 10 + 1= ? FRONT BACK s 2 COUNTER D 3 FULL EMPTY 0 1 4 5 1 Index of Array MyQUE Items Front Back Figure 1 showing an empty rounded Queue. Instruction: show your working plan in flowchart or state diagram or pseudo code. Task 1 a: 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