Purpose this assignment is an exercise in implementing the queue adt using an "circular" array-based data structure as discussed in lecture. this assignment also introduces the concepts of templates and exception handling. assignment this program creates and implements a class to represent the queue adt using an array. a driver program is provided for this assignment to test your implementation. you don't have to write the tests. program you will need to write a single template class for this assignment, the queue class. you will need to implement several methods and functions associated with this class. since this is a c++ template, all of your code should be placed in a single header (.h) file. this includes the implementations of all methods and any other associated functions. class queue data members this class contains a pointer to an item of the template parameter type that will point to the first element of a dynamically allocated array (the queue array). because the array is allocated dynamically, a data member is also maintained inside the class to determine the maximum number of elements that may be stored in the array (the queue capacity). another data member is used to keep track of the number of data items currently store