10 which of the following algorithms is correct for INSERTING AN ELEMENT AT THE RIGHT SIDE OF THE DE-QUEUE Select one: out of O a. = - right-+ 1)) ve flag 1. Input the DATA to be inserted 2. If ((left == 0 && right MAX-1) || (left (a) Display "Queue Overflow" (b) Exit 3. If (left -1) (a) left = 0 (b) right = 0 4. Else (a) if (right == 0) (i) left = MAX -1 (b) else (1) right right+1 Window 5. Q[right] = DATA 6. Exit b. 1. Input the DATA to be inserted 2. If ((left == 0 && right == MAX-1) ) (a) Display "Queue Overflow" (b) Exit 3. If (left == -1) (a) left = 0 (b) right = 0 4. Else (a) if (right == MAX -1) (i) left = 0 (b) else () right = right+1 5. Q[right] = DATA 6. Exit