Q$2)(5$p$)$ for each insertion$)$Given the following Red$-$Black Tree, show the tree that results after

Represents a BLACK node

a$)$ inserting $50$ write operations applied, and draw the tree.

b$)$ inserting $52,$ write operations applied, and draw the tree.

c$)$ inserting $90,$ write operations applied, and draw the tree.

d$)$ inserting $91,$ write operations applied, and draw the tree.