having difficulty with this problem

okay, I am doing this problem my friend gave me as a challenge and I want to convert it into code but it almost seems impossible to convert this problem into code to get the solution. any help or suggestions?

here is the problem:

we start from [start] and have to reach the destination [end] only by moving up and right. I cannot move down or left. how many different solutions are there?

Code:

` ____________`

| end

| |

| |

| |

| |

| |

| |

| |

| __________|

start

do I need to use some form of nested loop or is there some simple formula to solve this?