how do u do this

Fill the keys 50, 61, 72, 81, 90, 92, 94, 96, 99 into the binary tree below, into spots from A to I, so that they satisfy the binary-search-tree property. List them in the answer window below the following way (the example lists only the first 4 items): "5 6 7 8..." (for A=5; B=6; C=7; D=8...) B E H Part 2 of 2 Is this tree a valid red-black tree, i.e., can it be coloured as a valid red-black tree? If yes, indicate which nodes (use letter labels) should be red (the rest are assumed to be black); if not, explain why such colouring is impossible. The null nodes are not shown on this tree, assume they are there