Show a Red Black Tree inserting a number 5,4,3,2,1,6 into an initially empty tree. In each insertion state whether if they follow case1, case2, case3 or no case color each node. And provide a step to delete number 5 from a tree. And provide sequence of number example where insertion sort would have faster asymptotic complexity than merge and insertion sort have slower complexity than merge sort.

Please help me to correct my following answer.

=>

4) 5 case ners case: I 38 8 8 4 3 13 2B B case Nen 4) 5 case ners case: I 38 8 8 4 3 13 2B B case Nen