Consider the following code fragment: t = BinaryTree (34) t.insert_left(27) t.insert_right (62) x = t.get_left() X.insert_left(75) x.insert_right(3) y = t.get_right() y.insert_left(90) y.insert_right(65) What does the binary tree look like which is created by the above code fragment? Draw the resulting tree in the answer box below