Assuming the BST is initially empty. Provide sequence of trees after inserting the following key value pairs one by one into the tree in the given order. (38,76), (95,71, (59, 74), (3, 95), (70, 13), (27,35], (5,67), 128, 50], 175, 86), f33, 83) An answer should have 10 trees, each tree corresponds to one insertion result. For each tree node, show key, value, and n fields using this notation: keyB, 11 value A, 20 D, 5