Write a single pure LISP function called DFS that perfo

Write a single pure LISP function called DFS that performs a depth-first search of a
tree. The function should take a single argument that is the list representation of the tree
and return a single top-level list of the terminal nodes in the order they would be visited
by a left-to-right depth-first search.Write a set of pure LISP functions that implement depth-first iterative-deepening.
Your top-level function called DFID should take two arguments the list representation
of the tree and an integer representing the maximum depth of the tree and return a single
top-level list of the terminal nodes in the order that they would be visited by a left-to-
right depth-first iterative-deepening search. Note that those nodes that are visited in
multiple iterations will appear multiple times in the output list.
Attachments: