In the plane let the positive end of the $$𝑥-axis$$ be directed towards East and the positive end of the $$y-axis$$ be directed towards North. Suppose you are at $$(0, 0)$$ and you want to go to $$(7, 12)$$. At every move you are allowed to move unit length towards East or unit length towards North from your current position but you are not allowed to visit any point $$(ℎ, 𝑘)$$ where both $$ℎ, 𝑘$$ are odd. Find the number of such paths $$𝑛$$.