Consider the following pseudo-code

while (m < n)

if (x > y) and (a < b) then

a = a + 1

y = y - 1

end if

m = m + 1

end while

What is the cyclomatic complexity of the above pseudo-code?