Which of the following sequences, if inserted into an initially empty binary search tree, would result in the tree having the maximum possible height? Select all that apply.

$($a$)$

$[1,2,3,4,...,99,100]$

$($b$)$

$[1,3,5,7,...,99,2,4,6,8,...,100]$

$($c$)$

$[50,51,49,52,48,53,...,1,100]$

$($d$)$

$[100,1,99,2,98,3,...,51,50]$

$($e$)$

$[100,99,98,97,...,2,1]$