Consider the following program and draw the program path graph and DD path graph.

Also find out cyclomatic complexity and independent paths.

void main ( )

{

int x, y;

scanf (“%d ”, &x);

scanf (“%d ”, &y);

while (x ! = y)

{

if (x > y)

x = x – y;

else y = y – x;

}

printf (“x = %d”, x);

}