for array A $=[1,3,10,12,55,57,91,98,100]$

$($c$)(3$ points$)$ Draw a binary search tree containing the elements in A with $4$ levels, or state that it is impossible and explain why.

$($d$)(3$ points$)$ Draw a binary search tree containing the elements in A with $6$ levels, or state that it is impossible and