In this assignment you are to use pointers to manipulate dynamically created arrays. An array's name is basically a pointer to the fisrt element of the array. Dynamic arrays are created using pointer syntax, but can subsequently use array syntax, which is the best practice approach. Instructions (main.cpp) Inside main.cpp implement the following functions: int makeArray (const int size); This function dynamically allocates an int array of the specified size. • size-the size of the dynamically allocated array. • returns - a dynamically allocated integer array of size elements. void initializeArray (int * array, const int size, const int initValue); This function initializes an array of size elements with the initValue. array-The array whose elements are to be initialized. size the size of the array. initValue the value with which to initialize each element. int duplicateArray (const int const sourceArray, const int size); This function duplicates an array of size elements. When copying dynamic instances of any kind you must be careful not to perform a shallow copy when a true duplicate is desired. A shallow copy simply assigns the contents of one pointer to another, i.e. ptr1= ptr2; A duplicate is a deep copy and requires memory allocation, i.e. ptr1 = new .... • sourceArray- The array being duplicated. Notice how neither the pointer nor the array are allowed to change (both const). • size-the size of the array being duplicated. • returns - a dynamically allocated array which is a duplicate of the source array. Note: The function mush dynamically create a new array and initialize each element with the corresponding source array's elements. string describeArray (const int const array, const int size); This function returns a formatted description of the array. • array-the constant pointer to a constant int. Neither the elements nor the pointer can be changed. size the size of the array. returns-returns a formatted description of the instance, i.e. [v1, v2...], where v1, v2... are the values of each element. This function uses the seekp() method of the ostringstream class to remove one character from the end of the stream. This removes the last, before the ] is added to complete the formatting. Example The following code: int sourceArray makeArray (5); initializeArray (sourceArray, 5, 5); int targetArray - duplicateArray (sourceArray, 5); cout << "source: " << describeArray (sourceArray, 5) << ", " << sourceArray << endl << "target: " << describeArray (targetArray, 5) << ", " << targetArray; produces the output: source: [5,5,5,5,51, 0x7f9fa4405aa0 target: [5,5,5,5,5), 0x7f9fa4405ac0 Notice how the two arrays, sourceArray and targetArray are two distinct memory locations rather than the same location. This implies a deep copy rather a shallow copy.

Debugging Exercise A Assume the following main module is in a program that includes the binarySearch function that was shown in this chapter. Why doesn't the pseudocode in the main module work? // This program uses the binarySearch function to search for a // name in the array. This program assumes the binarySearch // function has already been defined. Module main() Constant Integer SIZE = 5 Declare String names[SIZE] = "Zack", "James", "Pam" %3D %3D "Marc", "Susan" Declare String searchName Declare Integer index Display "Enter a name to search for." Input searchName Set index = binarySearch (names, searchName, SIZE) %3D If index != - 1 Then Display searchName, %3D %3D was found." Else Display searchName, End If was NOT found." End Module

DESIGN YOUR OWN SETTING Task 5: Devise your own setting for storing and searching the data in an array of non-negative integers redundantly. You may just describe the setting without having to give an explicit algorithm to explain the process by which data is stored. You should explain how hardware failures can be detected in your method. Once you have described the setting, complete the following: Write a pseudocode function to describe an algorithm where the stored data can be searched for a value key: if the data is found, its location in the original array should be returned; -1 should be returned if the data is not found; -2 should be returned if there is a data storage error Include a short commentary explaining why your pseudocode works Describe the worst-case and best-case inputs to your search algorithm Derive the worst-case and best-case running times for the search algorithm Derive the Theta notation for the worst-case and best-case running times Maximum word…

C++ Language   Please add an execution chart for this code like the example below. I have provided the code and the example execution chart. : JUST NEED EXECUTION CHARTTT. Thanks Sample Execution Chart Template//your header files// constant size of the array// declare an array of BankAccount objects called accountsArray of size =SIZE// comments for other declarations with variable names etc and their functionality// function prototypes// method to fill array from file, details of input and output values and purpose of functionvoid fillArray (ifstream &input,BankAccount accountsArray[]);// method to find the largest account using balance as keyint largest(BankAccount accountsArray[]);// method to find the smallest account using balance as keyint smallest(BankAccount accountsArray[]);// method to display all elements of the accounts arrayvoid printArray(BankAccount accountsArray[]);int main() {// function calls come here:// give the function call and a comment about the purpose,//…