Answer the following questions:

Question $1$

a$)$ Insert the following values into a binary search tree; draw the resulting BST$.$

"meh", "idk", $"$brb$","$ok$","$sry$",$ "lol"

b$)$ List the preorder, inorder, and postorder traversal.

c$)$ What is the height of the tree? What is the max width of the tree?

Question $2$

Given the following expression in infix notation:

$3-18/6*2+3*7$

a$)$ Draw the binary tree.

b$)$ Give all three traversals.

c$)$ Is the tree drawn in part $($a$)$ a binary search tree?

d$)$ Solve the expression.