C++ Directions: Follow the insttructions of implementation and then fill in the following code for QueueArray class

Both given below:

5.1 Implement QueueArray

5.2 Implement QueueArray

5.3 Implement QueueArray

5.4 Implement void QueueArray

5.5 Implement DataType QueueArray

5.6 Implement void void QueueArray

5.7 Implement bool QueueArray

5.8 Implement bool QueueArray

5.9 Implement void QueueArray

5.10 Implement DataType QueueArray

5.11 Implement int QueueArray

#include "QueueArray.h"

template

template

template

template

template

template

template

template

template

template

template

template

//--------------------------------------------------------------------

template

{ int j; // Loop counter

if ( front == -1 ) cout << "Empty queue" << endl; else { cout << "Front = " << front << " Back = " << back << endl; for ( j = 0 ; j < maxSize ; j++ ) cout << j << "\t"; cout << endl; if ( back >= front ) for ( j = 0 ; j < maxSize ; j++ ) if ( ( j >= front ) && ( j <= back ) ) cout << dataItems[j] << "\t"; else cout << " \t"; else for ( j = 0 ; j < maxSize ; j++ ) if ( ( j >= front ) || ( j <= back ) ) cout << dataItems[j] << "\t"; else cout << " \t"; cout << endl; } }