Draw a Control Flow Graph to compute the Cyclomatic complexity of the above program.

int find-maximum(int i,int j, int k){

int max;

if(i>j) then

if(i>k) then max=i;

else max=k;

else if(j>k) max=j

else max=k;

return(max);

}