Can you do this problem in Drracket code only. The answer should be exactly what was mentioned below even the parenthesis should be exact. The instructions goes like this:

Part$2$: write a recursive function that given a list of numbers and a tree, returns a tree with all of the numbers inserted. The instructions of part$2$is:

Part two is another recursive function list$-$to$-$tree that takes a list of numbers and a sorted tree and inserts all of the numbers from the list into the tree. This function can be given an empty list as input for the sorted tree.

List$-$to$-$tree will repeatedly call tree$-$insert.

Test your function with:

$($list$-$to$-$tree$\text{'}(22257168346773217845319)())$

Returns$\text{'}(22((7((7((4((3)(5)))()))(16((8((8)()))(17((19)))))))(25((34((32)(67)))))))$

Your function MUST match this output for any credit.

Numbers in the first subtree are less than or equal to the root node

Numbers in the second subtree are greater than the root node

$\text{'}(6((3((2)(5)))(7((9)))))$is a sorted binary tree