10. Use array as storage body to implement a circular template queue class. (15 Points) // storage body // storage size // head position // tail position // number of items hold template class my Queue{ T*ptr; int size; int head; int tail; int hold; public: myQueue(int); ~myQueue(){free(ptr);} bool empty(){return hold==0;} bool full(){return hold=-size;} int hold(){return hold;} void append(T); T get(); }; // constructor // destructor // empty or not // full or not // number of items hold // append an item to tail Il get an item from head