... four queues queue1 , queue2 , queue3 , queue4 loop (not EOF) read (number) if (number < 10) queue1 .EnQueue(number) else if (number < 20) queue2 .EnQueue(number) else if (number < 30 ) queue3 .EnQueue(number) ... position in array) o DeQueue a queue having only one element: both rear and front must be updated (receive -1 value) In any successful case, count must be updated 30 31 32 33 34 Queue Applications ... front = -1 rear = -1 end Create count front -1 rear -1 29 EnQueue & DeQueue Algorithm Contiguous Implementation EnQueue is successful when queue is not full DeQueue is successful when queue...