Control flow graph and find cyclomatic complexity

1. int find maximum(int i, int j , int k){
2. int max
3. if(i>j) then
4. if(i>k) then
5. max=i;
6. else max=k
7. else if (j>k) then
8. max=j;
9. else max=k;
10. return (max);}