A robot is placed at the top$-$left corner of a $4$x$5$ chess board and can only move one square at a time. How many different paths are there for the robot to reach the bottom$-$right corner in the shortest number of moves $($using only right and down moves$)?$ Give a specific number as your answer, e$.$g$.10($with no space before or after$).$