Question 39
In one step you can get from the point $A(i|j|k)$, with $i, j, k \in \{0,1,2,3\}$, to another point on the cube grid by always increasing exactly one of the coordinates by $1$.
Find the number of all shortest paths that lead from the origin $O(0|0|0)$ to the point $P(3|3|3)$.
Find the number of all shortest paths that lead from the origin $O(0|0|0)$ to the point $P(3|3|3)$.