Consider the following directed graph: 

Which of the following is/are correct about the graph?

What is the worst-case number of arithmetic operations performed by recursive binary search on a sorted array of size n?

Consider the following ANSI C program:

int main() {

Integer x;

return 0;

}

Which one of the following phases in a seven-phase C compiler will throw an error?  

In the context of compilers, which of the following is/are NOT an intermediate representation of the source program?