Create a class template that implements a queue (FIFO structure, First-in First-out). First item pushed (in line), is first item popped (served). You queue class template only needs to implement push and pop. You do not need to implement length or isEmpty. Test your class template in main() with data of at least two types (one string type, and one numeric). It is recommended that you model your queue template from the stack class template discussed in class (LIFO structure, Last-in, First-out).