Q$1[10$ pts$.]$: Given the following key sequence $(16,22,9,14,3,1,8,37,99,5)$ build the dynamic binary search tree WITHOUT BALANCING IT$.$ How many probes $($i$.$e$.,$ comparisons$)$ does it take to determine that key $100$ is not in the tree? $($In this study case, the root is $16$; the next element $22>16,$ so it goes to the right, etc$).$