Given are the following numbers: $24,7,13,106,87,15,39,12,4,52.$

Process this sequence of numbers from left to right, inserting one number at a time into a Binary Search Tree. You will start with an empty tree, the insert the first number, then the next... etc. Make sure that each next number will find a place in the tree such that the resulting tree satisfies the $$binary search tree property$($numbers in left subtree of a node are smaller, numbers in the right subtree of a node are larger$).$

Show your resulting BST$.$ This is a pencil$-$and$-$paper, not programming, problem.