Write a lisp function make-cbtree that receives a list, and returns a complete binary tree whose nodes are populated from the elements of the list in the same order. An example is given in the following: (make-cbtree (8 3 10 1)) (8 (3 (1 () () () (10 0 ())) (make-cbtree (8 3 10 1 6)) (8 (3 (1 () () (6 () ()) (10 () ())) 10 You may use auxiliary functions to processed the list, including the split function in above.