A. Write the code to declare a dynamic array of strings (use the string pointer variable p1) that has as many elements as the variable arraySize. (2 Points)

B. Determine the output of the following code segment. Show all working. (5 Points)

#include

using namespace std;

void arr(int*);

int main()

{

const int NUMBERS = 6;

int nums[NUMBERS] = { 47, 8, 29, 54, 76, 99 };

arr(nums);

return 0;

}

void arr(int* val)

{

cout << endl << *val;

cout << endl << *(val + 1);

cout << endl << *(val + 5) - 5;

cout << endl << *(val + 4) / 9;

cout << endl << endl;

return;

}

C. Write a function, sum67(int a[], int n), that returns the sum of the numbers in the array, except ignore sections of numbers starting with a 6 and extending to the next 7 (every 6 will be followed by at least one 7). Return 0 for no numbers. (5 Points)

sum67({1, 2, 2}, 3) 5

sum67({1, 2, 2, 6, 99, 99, 7}, 7) 5

sum67({1, 1, 6, 7, 2}, 5) 4