(a) Define red-black tree.

(b) Consider the sequence of keys (5, 16, 22, 45, 18, 30, 50, 12, 98, 55, 77, 66, 55 ). Draw the result of inserting entries with these keys (in the given order) into an initially empty red-black tree.

(c) Consider the sequence of keys (5, 16, 22, 45, 18, 30, 50, 12, 98, 55, 77, 66, 55,14 ).

Draw the result of inserting entries with these keys (in the given order) into an initially empty red-black tree.