This chapter described another array-based implementation of a queue that uses no special data member-such as count or is Full (see the previous programming problem)-to distinguish between the full and empty conditions. In this implementation, you declare MAX_QUEUE + 1 locations for the array items, but use only MAX_QUEUE of them for queue items. You sacrifice one array location by making front the index of the location before the front of the queue. The queue is full if front equals (back + 1) % (MAX_QUEUE + 1), but the queue is empty if front equals back. Implement this array-based approach.