Consider the following ANSI C program.

#include<stdio.h>

int main(){

int arr[4][5];

int i, j;

for(i =0; i<4; i++){

for (j =0; j<5; j++){

arr [i][j] = 10*i + j;

}

}

print("%d", *(arr[1] + 9));

return 0;

}

What is the output of the above program?

Let L ⊆ {0,1}* be an arbitrary regular language accepted by a minimal DFA with k states. Which one of the following languages must necessarily be accepted by a minimal DFA with k states? 

Consider the following deterministic finite automaton (DFA).

The number of strings of length 8 accepted by  the above automaton is __________

For a string w, we define wR to be the reverse of w. For example, if w = 01101 then wR = 10110.

Which of the following languages is/are context-free?