Answer Happy

choices:
Given the following Array class, how should we implement the destructor so that it causes no errors and avoids memory leaks? #include <string> #define MAX 256 using namespace std; Class Student public: Student(const string& n = "000000000",const string& s = "Hey you!"); private: string number; string name; undefined class Array { public: Array():size(){elements = new Student [MAX); } Array(); void add(const string& name, const string& num); int get(int index); int getSize(); private: int size; Student* elements;
Array(){ delete [] elements; -Array { for (int i = 0; i < size; ++i) { delete elements; } delete [] elements; undefined Array ( 0 Array() { for (int i = 0; i < MAX; ++i) { delete elements[1]; } delete [] elements; None of these.