Question $5$

Consider a binary search tree with the keys $1,2,3,4,5.$ In what order can we insert these keys so that the height of the binary search tree is as small as possible with these keys? Choose all answers that apply.