<s>[INST] A robot is programmed to move in a grid and it can only move in four directions: up, down, left, or right. The robot’s movements create a path. The path is constrained to stay within the boundaries of the grid. If the robot starts at the origin (0,0) of a grid with dimensions 4x4, how many possible unique paths are there for the robot to reach the bottom left corner of the grid?[/INST]