template <class Queue entry> Error code Queue<Queue entry> :append(const Queue entry &item //Post: item is added to the rear of the Queue. If the Queue is full return an overflow and leave the queue unchanged. i if (count>=maxqueue) return overflow count + rear =((rear+1)==maxqueue)?0: (rear+1); entry[rear]=item; return successtemplate <class Queue_entry> Error_code Queue<Queue_entry>::append(const Queue_entry &item) // Post: item is added to the rear of the Queue . If the Queue is // full return an overflow and leave the Queue unchanged. { if (count>=maxqueue) return overflow; count ++; rear = ((rear+1) == maxqueue) ? 0: (rear+1); entry[rear]=item; return success; }