Consider the program given below
void main() {
int i,j,k;
readln (i,j,k);
if( (i < j) || ( i > k) )
{
writeln("then part");
if (j < k)
writeln ("j less then k");
else writeln ( " j not less then k");
}
else writeln( "else Part");
}
(i) Draw the flow graph.
(ii) Determine the cyclomatic complexity.
(iii) Arrive at all the independent paths.