Mini Queue Template

Create a template class MiniQueue<T> backed by a vector<T> that behaves like a queue (first in, first out).

Implement:
- enqueue(T item): adds item to the back of the queue
- dequeue(): removes and returns the item from the front. If the queue is empty, print "Queue is empty" and return T{}
- isEmpty(): returns true if the queue has no elements
- size(): returns the number of elements as an int

Do NOT write a main function.