In C$++$ Create a template of the class Queue in the form of an array that simulates the operation of a queue.

Queue $-$ a data structure in which access to elements is organized according to the FIFO principle $($FIFO$,$ First In $-$ First Out$).$

Adding an element $($enqueue$)$ is possible only at the end of the queue, deleting $($dequeue$)-$ only from the beginning of the queue.

Implement functions:

void enqueue$($Type $)$;

Type dequeue$()$;

void PrintQueue$()$;

Test the work of all functions with data types: int, float, char.