Homework: Implement a function Extend that attaches a Chain B to the end of a Chain A Example A={2,6,4,7} length=4 B={1,0,7} length=3 A.Extend(B)= {2,6,4,7,1,0,7} new length of A = 7 in the code give below add this function #include #include class NoMem { public: NoMem() {} }; void my_new_handler() { throw NoMem(); } class OutOfBounds { public: OutOfBounds() {} }; template struct Node{ T data; Node *next; }; template class Chain { public: Chain (){first=0; length=0;} // constructor ~Chain(); bool IsEmpty () const {return (first==0);} int Length() const {return length;} // bool Find (int k, T& x) const; // return kth element into x int Search (const T& x) const; // return position of x Chain& Delete (int k, T& x); // delete k element into x Chain& Insert (int k,const T& x); // insert x at k element void Output () const; private: Node *first; //pointer to the first node int length; }; //destructor // complexity O(length) template Chain::~Chain() { Node *nextp; while (first) { nextp=first->next; delete first; first=nextp; } } // Find kth element and return true if possible // Complexity O(length) template bool Chain::Find (int k, T& x) const { Node *current=first; if (k < 1 || k > length) return (false); for (int j = 1; j < k; j++) current=current->next; x=current->data; return (true); } // Find the position of first occurence of x, 0 otherwise // Complexity O(length) template int Chain::Search(const T& x) const { Node *current=first; for (int index=0; index < length ; index++){ if (current->data==x) return (++index); current=current->next; } return 0; } //Delete kth element of the list and return value to x //OutOfBound exception is thrown if k< 1 or k > length //complexity O(length-k)=O(length) template Chain& Chain::Delete(int k, T& x) { Node *current=first,*prior=first; int index=1; if (Find(k,x)) { // able to locate k node while (index < k) { prior=current; current=current->next; index++; } x=current->data; if (k==1) //we want to delete first node first = current->next; else //we want to delete another node prior->next = current->next; delete current; //delete node length--; return *this; } throw OutOfBounds(); } // insert x into k position // throws exception OutOfBound if k < 1 or k > // throws exception NoMem if list is full; template Chain& Chain::Insert(int k, const T& x) { if (k < 1 || k > length + 1) throw OutOfBounds(); Node *current=first, *prior=first; for (int index=1; index < k; index++) { prior=current; current=current->next; } Node *newnode=new Node; newnode->data=x; if (k==1) { first = newnode; } else { prior->next = newnode; } newnode->next = current; length++; return *this; } //outputs list template void Chain::Output() const { Node *current=first; cout << endl << "List: "; while (current){ cout << current->data << " "; current=current->next; } } main() { set_new_handler(my_new_handler);//when new fails, new call my_new_handler // which in return throws a NoMem exception try { Chain L; cout << endl << "Length= " << L.Length() ; cout << endl << "IsEmpty = " << L.IsEmpty(); L.Insert(1,2).Insert(2,3).Insert(3,4).Insert(4,5); L.Output(); cout << endl << "IsEmpty = " << L.IsEmpty(); int z; L.Find(1,z); cout << endl << "First element is: " << z ; cout << endl << "The length of the list is: " << L.Length(); L.Delete(1,z); L.Output(); } catch(NoMem) { cerr << "Not enough memory" << endl; } catch(OutOfBounds) { cerr << "Out of bounds " << endl; } }