recursion – cyclomatic complexity of the recursive function

My goal is to find the cyclomatic complexity of the code, but this implies a recursion, so I'm confused if the recursive statement will take it to the beginning in cfg.
Can anyone confirm … I have uploaded my solution.
enter the description of the image here

test (int a, int b, int c) {
B: = C + 5;

WHILE (X! = 1) {
X = X - 1;

IF (X = 7) X: = 8;
PROOF OF ELSE (X, 3, X-1);
}
}