which of the following algorithms is correct to delete element from the queue

Select one:

a. 1. If (rear> front) (a) Front = 0, rear = 1 (b) Display The queue is empty (c) Exit 2. Else (a) Data = Q[front] 3. Front = front +1 4. Exit

b. 1. If (rear< front) (a) Front = 0, rear = 1 (b) Display The queue is empty (c) Exit 2. Else (a) Data = Q[front] 3. Front = front +1 4. Exit

c. 1. If (rear> front) (a) Front = 0, rear = 1 (b) Display The queue is empty (c) Exit 2. Else (a) Data = Q[rear] 3. Front = front +1 4. Exit