Jacobian FK implementation

Replace the Jacobian computation used in the previous assignment by your own algorithm, recursively traversing the kinematic tree from end effector to root. As a template consider the iterative pseudo-code presented in the script.

Think about a data structure to cache and reuse intermediate results (i.e. transforms from root to current node) such that consecutive request for the same joints get processed faster.