please explain

Use the following character Queue ADT implementation for the next 2 questions. class Queue { private: front reari char queue [MAX_SIZE] int size; public: Queue ) // Initializes an empty queue void pushBack (char newItem); If the queue were to be implemented as a linked list, which of the private members would you not need? 6. a. queue b. front c. rear d. size 7. In an array based implementation what type would front and rear be? a. int b. char c. Node d. bool