For the problem attached 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$)$ and identify the set of Independent Paths.Multiplication Table. $[4$ Points$]$

def multiplication$\_$table$($n$)$:

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

for j$\}\backslash$mathrm$\{$ in range$(1,$ n $+1)$:

result $=$ i $*$ j

if result $\%10==0$:print$("$Divisible by $10")$

else:print$($result$)$