$2810$ points

Suppose you have an empty Binary Search Tree and are given the following list of elements to insert:

$4,8,1,6,1,7,5,3,4$

Insert each of the elements in the list above in the order they appear into your Binary Search Tree.

Draw the resultant tree after each insertion.

Upload the image containing your drawings of your tree after each insertion. Clearly show the before and after of each insertion as well as the final Tree.