Consider the following red$-$black tree, on which we will perform a sequence of updates: Node $($Black$,$ Leaf, $5,$ Node $($Red$,$ Leaf, $10,$ Leaf$)).$ After each update, give the height of the resulting tree $($height of Leaf is $0),$ the number of red nodes and the key in the root of the tree. Keep in mind that each update takes place after the preceding ones.