Concatenate all the following digits, $1293459,$ with $9$ in front of it and $1$ at the end and form a list.

Example: $1293459,$ after concatenation $912934591,$ the list: $9,1,2,9,3,4,5,9,1.$

a$)$ create a Binary search tree $($BST$)$ displaying step by step $($redraw it after every element is inserted one by one left to right$)$ from your list.

b$)$ represent in$-$order traversal of your BST$.$ Provide the resulting list and a drawing of BST with arrows and $/$ or sequential numbers on it $($so the logic of your traversal is clear at$-$a$-$Glance$)$

c$)$ represent pre$-$order traversal of your BST$.$ Provide the resulting list and a drawing of BST with arrows and $/$ or sequential numbers on it $($so the logic of your traversal is clear at$-$a$-$Glance$)$

d$)$ represent post$-$order traversal of your BST$.$ Provide the resulting list and a drawing of BST with arrows and $/$ or sequential numbers on it $($so the logic of your traversal is clear at$-$a$-$Glance$)$

e$)$ represent breadth$-$first $($level by level$)$ traversal of your BST$.$ Provide the resulting list and a drawing of BST with arrows and $/$ or sequential numbers on it $($so the logic of your traversal is clear at$-$a$-$Glance$)$