Java red black tree | Computer Science homework help

ÿ
Trace the operation of a Red-Black Tree given the following operations:insert(49)insert(85)insert(51)insert(90)insert(28)insert(37)insert(61)insert(10)insert(32)insert(40)insert(59)insert(19)insert(63)insert(26)insert(55)Next, Delete the following items sequentially.delete(49)delete(59)delete(51)delete(19)delete(26)delete(10)Starting with an empty tree, perform the following insertion operations:
2insert(14)insert(95)insert(71)insert(36)insert(25)insert(88)insert(27)insert(33)insert(79)insert(81)insert(63)insert(26)insert(30)insert(44)insert(62)And then do the following deletions:delete(88)delete(30)delete(27)delete(79)delete(62)delete(44)2 Deliverables(a) Implement the above using Java(b) Your paper work sheets showing work sufficient to show what you were d