consider the sequence of keys ( , , , , , , , , , , draw the result of inserting entries with these keys (in the given orderinto an initially empty ( , tree an initially empty red-black tree - for the following statements about red-black treesprovide justification for each true statement and counterexample for each false one subtree of red-black tree is itself red-black tree the sibling of an external node is either external or it is red there is unique ( , tree associated with given red-black tree there is unique red-black tree associated with given ( , tree - draw an example red-black tree that is not an avl tree - consider tree storing , entries what is the worst-case height of in the following casesa is an avl tree