$(9)$ Which of the tree traversal algorithms does visit elements on BST in ascending order?

$($a$)$ Pre$-$order

$($b$)$ In$-$order

$($c$)$ Post$-$order

$($d$)$ None of the above