Robot Movings

Given a square table sized $N$ x $N$ (rows and columns are indexed from 1) with a robot on it. \ The robot has a mission of moving from cell (1, 1) to cell ($N$, $N$) using only the directions "right" or "down". \ You are requested to find the number of different ways for the robot using exactly $K$ turns. \ The answer should be given with modulo $10^9+7$. #### Note: We define a "turn" as a right