Implement a binary search tree in LISP, and use it to sort some numbers with treesort. You do not need to implement all the methods above, and you can (and probably should!) use a simpler encoding ln iad you can (and probably The following method signatures are required: (defun insert (tree x) inserts t to the binary search tree (defun 1ist-to-tree (mylist &optional tree) ;; note: the second argument 'tree, will be nil by defa inserts every element of the list 'mylist' into the tree (defun inorder (tree.) ;; list giving the inorder traversal of the tree