Insert the following items into a Red Black Tree accounting…

Insert the following items into a Red Black Tree accounting for any rotations: 7, 6, 3, 1, 9, 4, 5, 0. Note that the elements are inserted in the aforementioned order. State the left to right level order traversal of the tree as well as the corresponding color of each node  (r for red and b for black) separated by spaces, e.g. 2b 1r 3r (This tree represents a Red black tree with three nodes: a black root 2, a left red child 1 and a right red child 3.)