Write a program in Common LISP, which

1) takes as input a phrase as a list, with each word in the phrase as a sublist of the list. For example: ((G O O D) (T I M E S)).

2) Shift each letter to the next letter in the alphabet. For example, A = B, D = E, Z = A etc.

3) Output the result as a string, not a list. "HPPE UJNFT"

4) Inputs the shifted phrase as a list into a function to return back to its orignal form ( (H P P E) (U J N F T) )

and,

5) Output the result as a string, not a list "GOOD TIMES"