General requirement to solve them is to print the pdf, solve it in hand, take picture of the solution, and combine them into a single pdf.

Try to solve the following exercise without using any compiler.

5) a. Match the following with reference (1 to 10) to the following segment (a to m):

b. If you want to store an array of 5 strings with the maximum length of a string is 100, how would you declare it?

c. Given a 2D array. Write a function that will take the 2D array as argument and then print the maximum value in each row of that 2D array. Also, write a line to show how would you call that function. Do not write the main function.

int x[3][5] = { { 1, 2, 3, 4, 5 }, { 6, 7, 8, 9, 10 }, { 11, 12, 13, 14, 15 } }; int *n = x; OVO AWN *(*(x + 2) + 1) *( *x + 2) + 5 *(*(x + 1)) *(*(x) + 2) + 1 * (*(x + 1) + 3) *(n +2) (*(n + 3) + 1 *(n + 5)+1 ++*n DOGOVOZY-E oo nr 00 v NW Ao