answer this question this is assginment plz neta and clean properly attempt

3. Implement a Queue (50 Marks) Queue is a commonly known data structure. A queue is similar to a checkout line in a supermarket -the cashier services the person at the beginning of the line first. Other customers enter the line only at the end and wait for service. Queue nodes are removed only from the head (or front) of the queue and are inserted only at the tail (or end). For this reason, a queue is a first-in, first-out (FIFO) data structure You are required to write a generic or template class ("MyQueue") that will have following methods: Method Name Description PrintQueue Prints the Queue contents to a console window Enqueue Adds an object to the end of the Queue Dequeue Removes and returns the object at the beginning of the Queue Determines whether an element is in the Queue How many items are in the queue Contains Count Note: * Your code should work with any data type and so should be a template or generic code. . Do not use STL containers. std::queue or any other container. Implement the queue yourself