Ononot — In a grid, you move from (0, 0) to (m, n) using only right (

Guest Session: 1 Question Remaining. Create Account to save progress.

Recursionmedium

0:00.0

In a grid, you move from $(0, 0)$ to $(m, n)$ using only right (R) and down (D) moves. However, at the special cell $(1, 1)$ , you may also move diagonally (DR). Let $G(m, n)$ denote the number of paths. Which recurrence relation correctly models this?