Consider the following insertion process in a BST$.$ t$.$insert$(9)$; t$.$insert$(7)$; t$.$insert$(6)$; t$.$insert$(10)$;t$.$insert$(15)$; Traverse this tree using Pre order method gives:

a$.9761015$

b$.9710615$

c$.6791015$

d$.6715109$