red-black tree

(20 pts) Fig. 1 illustrates a red-black tree, where a thick circle represents a black data-bearing node, a thin circle represents a red data-bearing node, and a thick rectangle represents a black nil node. In your work, you have to write black near a black node and write red near a red node to indicate the colors. Alternatively, you may use a rectangle to represent a black node, and use a circle to represent a red node. 15 50 40 10 0o 00 23 58 DO OD Figure 1: A red-black tree pts) Draw the resulting red-black tree after inserting 21 into the red-black tree in Fig pts) Draw the resulting red-black tree after deleting 5 from the red-black tree in Fig pts) Draw the resulting red-black tree after deleting 0 from the red-black tree in Fig pts) Which property or properties (give the property number) may be violated when inserting pts) Which property or properties (give the property number) may be violated when deleting 1. You only have to draw the portion of the tree that is affected 1. You only have to draw the portion of the tree that is affected 1. You only have to draw the portion of the tree that is affected a new node into a red-black tree? Describe the violation before the fix-up a node into a red-black tree? Describe the violation before the fix-up