I did this problem patially correct and I missed few points as shown. Plz do it as easy as you can.

Il: Problem Solving and Programming Questions (70 pts)- Write C+ code corstructed by using an array allocated on the heap. tonplate cclass T 142 pts) Given the follo ing Queue class template, write the function template for the dequeue ti function. Note: the queue s the function class Queue public: Queue (int nevsize-0) -Queue bool enqueue (T new!ten) bool dequeue (T &removedItem) bool isEnpty) int nSize: II represents tbe nunber of stems in the queue private: xsize: / must sot exceed the max size of our allocated array .mpront; // will point to the beginning of contiguous tenor y on // the heap (an aeray) // Place your function template for dequeue ) below. 11 Description: Removes the iten at the front of the queue Calways index e) by shifting all tems to the left by 1 in the array. You may assume that any necessary operators to /l perform the shift are overloaded for type T. A successful removal /I decreases msize by 1 /I Returns: true if the Stem was renoved from the contiguous memory; false etherise / Precondition: mpFront must already point to contiguous memory: specifically iten at index e 17 Errors: check that the array is not enpty; if the array is enpty, then return false. Cis Enpyc)) else C+ taun true