Answer Happy

Answer question 2(a) to 2(b) based on the following code below:- struct Queue { int front; int rear; int maxsize; int* arraynum; Queue(int c) { }; }; front = 0; rear = 0; // points to the front element in the queue (if any) // rear points to last element in the queue // maximum size of the queue // an array that stores queue elements maxsize = c; ____(a)____// lines given are not indication of answer (b) //lines given are not indication of answer Za) Based on the following code above, please complete the constructor Queue code segment as shown in a 2b) Based on the following code above, please write the destructor Queue code segment as shown in b. [1 mark] [2 marks]