The output of the following C program is__________.

void f1(int a, int b) { 
int c; 
c=a; a=b; b=c; 
}

void f2(int *a, int *b) { 
int c; 
c=*a; *a=*b; *b=c; 
}

int main(){ 
int a=4, b=5, c=6; 
f1(a,b); 
f2(&b, &c); 
printf(“%d”,c-a-b); 
}

Match the following:

Consider the following C program segment.

while(first <= last) 
{ 
    if (array[middle] < search) 
        first = middle + 1; 
    else if (array[middle] == search) 
              found = TRUE; 
          else last = middle - 1; 
    middle = (first + last)/2; 
}
 if (first > last) notPresent = TRUE; 

The cyclomatic complexity of the program segment is ________.

Consider the DFAs M and N given above. The number of states in a minimal DFA that accepts the language L(M) ∩ L(N) is___________.