No. of pathways from one point to another in a square grid There are 4 by 4 square grid pathways connecting southwest end and northeast end. How many different ways do exist?

My Anwser: $8C4$ I took it that there are 8 right's, RRRRRRRR. However, we need 4 of these R's to be Ups or U's, which implies we need $8C4$ such combinations. Does this make sense?
***YEAH THAT'S RIGHT.

In a 4x4 grid, to end go southwest to northeast end, we have 8 choices of which 4 are right and the other up; then the total number of minimum paths (→ ↑) is 8C4.***
***YEAH THAT'S RIGHT.

In a 4x4 grid, to end go southwest to northeast end, we have 8 choices of which 4 are right and the other up; then the total number of minimum paths (→ ↑) is 8C4.***