Step 1: PreparationComment out the following under-construction code:In dynamicaray.h: Al function prototypes except the constructors and destructor. Keep the member variables.In dynamicarray.cpp: All function implementations except the constructors and destructor. Also remove (not just comment out) INITIAL_CAP, and replace it with a hard-coded 10 inside the default constructor. This will also eventually go away.In main: Comment out all the code inside the RunPart1Tests function between the lines. Also in main: Comment out all the code in the main function starting with the "Equality comparison" comment and just before the "return O;" line.bool pass = true;andreturn pass;Step 2: Replacing member data and the two constructorsReplace the current member data (arr, len, and capacity) with a single vector of integers.At the top of your h, include the vector library. This is the only place you should need to include it.Also in your .h, remove your current member data, replace it with a vector of ints. Name it "arr" so you can keep as much of your current code as possible.Next, you need to change the constructor and destructor.For the copy constructor, copy the vector from the other object; do so by doing an element-by-element copy.Here's your new copy constructor in all its glory:DynamicArray::DynamicArray(const DynamicArray& other) : arr(other.arr) {}It should report the Lab 6 tests as "passed."Step 3: The one-liners plus outputTackle the four member functions (cap(), at), append() and operator=) that translate very well to functions that the vector class provides for you. You'll also tackle print, since you'll need it to check your results.What to Do:Uncomment the declarations and definitions from the .h and .cpp filesReplace cap() function (defined in the .h) with a single-line function that uses a member function of the vector class.Do the same for the at() and append() function. Do not return -11111 when out of boundRepeat for the = operator. This will be two lines: one to actually copy the vector. and then the obligatory return * this;Replace these references with the appropriate ways to access them using your new vector.When you're ready to test your code, go to the RunPart1 Tests function in main.cpp. Put everything back in until the line labeled "Test sum."Two bad things are going to hapen:You're going to fail two capacity tests. You can comment out the sections that test the capacity.This code should crash, with an error message including:terminate called after throwing an instance of 'std::out_of_range: vector' Step 4: The remaining functionsYou should have three functions left. They don't map as nicely to vector's member functions as append(), cap(), and at(), so you will have to write more of your own code.sumSum is the next easiest function to write, because the changes you make will be very similar to what you already did for print(). Here are the steps:1. Un-comment it from dynamicarray.h2. In dynamicarray.cpp, make similar modifications to the ones you made for print()3. In main.cpp, put the "Test sum" section back into RunPart1 Tests().Compile and run your code. You should now be passing all the current tests.operator ==The vector function doesn't have an equality operator, so your code still has to do the work of defining one. Again, the changes aren't too bad:1. Uncomment it from your.h2. Modify the implementation as necessary3. In the main() function of main.cpp, put the Equality Comparison tests back in.Recompile and rerun. Everything should pass.removeLast but not least, we have remove().The good news is that tracking the length of the array and resizing the array as needed are no longer your problem, so that gets rid of a lot of your code.Here's what you still have to do:1. Uncomment it from your .h2. Modify the implementation as follows1. Find valToDelete in the vector, and return false if it's not there.2. When you find it, you need to call vector's erase function and pass it an iterator for the position you want to delete. For us, that'svector.begin() + i where i is the position of the element. Then return true. You do NOT need to worry about scooting the remaining elements to fill the gap -- vector will do that for you.Testing times:1. In function RunPart1 Tests() in main.cpp, put everything back except the capacity tests you've already commented out, and the single (long) line of code under a.remove(100 + i). At this point, you should be passing all the Part 1 tests.2. In function main() in main.cpp, uncomment the rest of the code. All tests should pass, and you should be getting the desired output.BTW, notice that we barely ended up changing main at all in the end! This is an example of using the same interface for two very different implementations of arrays.That said, let's make one FINAL FINAL change to the main() to accommodate the output operator.Step 5: Overloading the output (

Question

Step 1: PreparationComment out the following under-construction code:In dynamicaray.h: Al function prototypes except the constructors and destructor. Keep the member variables.In dynamicarray.cpp: All function implementations except the constructors and destructor. Also remove (not just comment out) INITIAL_CAP, and replace it with a hard-coded 10 inside the default constructor. This will also eventually go away.In main: Comment out all the code inside the RunPart1Tests function between the lines. Also in main: Comment out all the code in the main function starting with the &#34;Equality comparison&#34; comment and just before the &#34;return O;&#34; line.bool pass = true;andreturn pass;Step 2: Replacing member data and the two constructorsReplace the current member data (arr, len, and capacity) with a single vector of integers.At the top of your h, include the vector library. This is the only place you should need to include it.Also in your .h, remove your current member data, replace it with a vector of ints. Name it &#34;arr&#34; so you can keep as much of your current code as possible.Next, you need to change the constructor and destructor.For the copy constructor, copy the vector from the other object; do so by doing an element-by-element copy.Here's your new copy constructor in all its glory:DynamicArray::DynamicArray(const DynamicArray& other) : arr(other.arr) {}It should report the Lab 6 tests as &#34;passed.&#34;Step 3: The one-liners plus outputTackle the four member functions (cap(), at), append() and operator=) that translate very well to functions that the vector class provides for you. You'll also tackle print, since you'll need it to check your results.What to Do:Uncomment the declarations and definitions from the .h and .cpp filesReplace cap() function (defined in the .h) with a single-line function that uses a member function of the vector class.Do the same for the at() and append() function. Do not return -11111 when out of boundRepeat for the = operator. This will be two lines: one to actually copy the vector. and then the obligatory return * this;Replace these references with the appropriate ways to access them using your new vector.When you're ready to test your code, go to the RunPart1 Tests function in main.cpp. Put everything back in until the line labeled &#34;Test sum.&#34;Two bad things are going to hapen:You're going to fail two capacity tests. You can comment out the sections that test the capacity.This code should crash, with an error message including:terminate called after throwing an instance of 'std::out_of_range: vector' Step 4: The remaining functionsYou should have three functions left. They don't map as nicely to vector's member functions as append(), cap(), and at(), so you will have to write more of your own code.sumSum is the next easiest function to write, because the changes you make will be very similar to what you already did for print(). Here are the steps:1. Un-comment it from dynamicarray.h2. In dynamicarray.cpp, make similar modifications to the ones you made for print()3. In main.cpp, put the &#34;Test sum&#34; section back into RunPart1 Tests().Compile and run your code. You should now be passing all the current tests.operator ==The vector function doesn't have an equality operator, so your code still has to do the work of defining one. Again, the changes aren't too bad:1. Uncomment it from your.h2. Modify the implementation as necessary3. In the main() function of main.cpp, put the Equality Comparison tests back in.Recompile and rerun. Everything should pass.removeLast but not least, we have remove().The good news is that tracking the length of the array and resizing the array as needed are no longer your problem, so that gets rid of a lot of your code.Here's what you still have to do:1. Uncomment it from your .h2. Modify the implementation as follows1. Find valToDelete in the vector, and return false if it's not there.2. When you find it, you need to call vector's erase function and pass it an iterator for the position you want to delete. For us, that'svector.begin() + i where i is the position of the element. Then return true. You do NOT need to worry about scooting the remaining elements to fill the gap -- vector will do that for you.Testing times:1. In function RunPart1 Tests() in main.cpp, put everything back except the capacity tests you've already commented out, and the single (long) line of code under a.remove(100 + i). At this point, you should be passing all the Part 1 tests.2. In function main() in main.cpp, uncomment the rest of the code. All tests should pass, and you should be getting the desired output.BTW, notice that we barely ended up changing main at all in the end! This is an example of using the same interface for two very different implementations of arrays.That said, let's make one FINAL FINAL change to the main() to accommodate the output operator.Step 5: Overloading the output (<<) operatorDefine and implement the output operator, which mirrors the print() method. Recall, the signature of this method is:friend ostream& operator<< (ostream &out, const DynamicArray& objToPrint);To test, replace the following lines at the end of main():stringstream testoutput;a.print(testoutput);b.print(testoutput);cout << testoutput.str();withcout << a << b;All tests should pass, and you should be getting the desired output.

Accepted Answer

Create a class called DynamicArray with a private member variable arr of type std::vector<int>…