Solution: First, compute the total number of paths from the bottom-left to the top-right without restrictions. The robot must make 5 right (R) and 5 up (U) moves, so: