For all the problems below, generate the Control Flow Graph $($CFG$),$ calculate the Cyclomatic Complexity using all $3$ methods $($M$=$R$+1,$ M$=$P$+1,$ M$=$E$-$N$+2$P$)$Finds pairs of numbers $(i,j)$ where $i$ is even, $j$ is odd, and their sum is greater than

a given number $k.$ If the sum is equal to $k,$ the program prints "Perfect match". If the sum

is less than k $,$ the loop continues. $[4$ Points$]$

def find pairs$($n$,$ k$)$:

for i in range$(1,$ n$+1)$:

for j in range$((1,$ n$+1)$:

if i $\%2==0$ and j $\%2!=0$:

sum$\_$ij $=$ i $+$ j

if sum$\_$ij $>$ k:

$\backslash$ Print pair and sum

print$($f$"$Pair $(\{$i$\},\{$j$\})$ with sum $\{$sum$\_$ij$\}")$

elif sum$\_$ij $==$ k:print$("$Perfect match"$)$ and identify the set of Independent Paths.