Problem 1:

A. Declare an integer array of size 13 called List. Initialize the array with 10 distinct values. Declare a integer pointer and use that pointer get 3rd and 8th element of the array List.

B. Declare an array of size 800. Set the values of the array in a way that each index contains "2*index+15" as values.

C. Declare a 2D array of size 3x6 and set all the values of the array with 36. Don't initialize with braces, use for loops. Then change value at row 1 column 4 to 4 and display the whole 2D array with for loops.

Problem 2:

A. Solve the fibonacci problem with recursion. But replace first number with 9 and second with 14 in the series.