Please help me with this problem. C++

For this lab, you will need to implement two functions, rearrange1() and rearrange2(), both member functions of the DArray class. Each function has a few restrictions. You should start with the first function, as it is easier, and then move to the second, which is more challenging but certainly more efficient. - Function rearrange1 - The function rearranges the data in the calling object so that the even numbers are stored before the odd numbers. You are required to follow a specific algorithm: Create 2 dynamic arrays to store even and odds numbers retrieved from the calling object. Copy the data from the "even" array into the calling object. Copy the data from the "odd" array into the calling object. Delete all dynamic data and null the pointers. - Assumption: There are at most two distinct digits in all test cases. - Function rearrange2 - The function does the same as the previous one, but without creating any containers (no arrays, vectors, DArray objects, and so on). You are shifting the data in the calling object, with the help of a variable of type int. - To make the function even more efficient, use an IF statement to check if there are at least 2 elements in the calling object. There is no need to go through any of the code if there is only one element, or if the calling object is empty. If that is the case, the function should skip all the code and exit (note that there is NO need to have an ELSE block). Page 1 of 2 Example 1 Calling object has 7 elements: 1414411 Function runs... Calling object has 7 elements: 4441111 Example 2 Calling object has 5 elements: 336366 Function runs... Calling object has 5 elements: 66333