I have the following program which is in C.

int main() {

do { scanf ( "&d ", &a);

} while (a>6);

for (i = 0; i

b = i;

while (b>=0) {

c = 5;

do {

c-- ;

} while(c>5);

b-- ;

} }

return 0;

}

1)Draw the circuit complexity graph

2)Define the 4 value classes of the variable a so that you have complete loop coverage for the for.

3)For each of the above classes choose one test case. Complete the table below for each test case with the number of iterations that each iteration structure will execute. When the condition of a structure is never checked, then we write - (dash), otherwise if it is checked but its body is never executed, we write 0.

	a =	a =	a =	a =
for
while
do-while