$4.$ For the Euclid's GCD computation algorithm given below draw the Control Flow Graph G$,$ compute the cyclomatic complexity $\backslash (\backslash$mathrm$\{$V$\}(\backslash$mathrm$\{$G$\})\backslash )$ and determine the basis paths and the corresponding test cases.

$```$

int compute$\_$GCD$($x$,$ y$)$

int x$,$y;

$\{1$ while$($x$!=$y$)\{$

$2$ if $($x$>$y$)$ then

$3$ x$=$x$-$y;

$4$ else y$=$y$-$x;

$5\}$

$6$ return x;

$```$