Following are the Candidates for leader :
1.. First statement is a leader
2. the target of unconditional and conditional instruction is a leader
3. Statement following unconditional and conditional instruction is a leader .
So let us count number of nodes :
Node1 :statement 1
node 2 : Statement 2
Node 3 : Statement 3
node 4 : statement 4--9
node 5 : Statement 10-11
Plus if i add one start and end nodes
So in all there will be 7 nodes
And the number of edges :
We know that in a simple connected graph with n nodes we have n-1 edges,
So here with 7 nodes we would have 6 edges + 2 edges ( GOTO 3 and GOTO 2--->backedges ) = 8 edges .