Write a Lisp function fibonacci2 to compute fibonacci number of n (where n is a positive integer) recursively with a global variable (e.g., a list, an array, or a hash table) to save the previous results to be used later to compute the next fibonacci number.