Write a recursive procedure that takes a tree $($represented as a list$)$ and returns a list whose elements are all the leaves of the tree arranged in right to left order. For example, $($ leaves $(1(23)4))$ returns $(4321).$ Then, Manually trace your procedure with the provided example.