(Solved) : Inserting Node Red Black Tree Re Balancing Deleting Result Original Tree B Deleting Node C Q27561960 . . . .

a) Does inserting a node into a red-black tree, re-balancing,and then deleting it result in the original tree?

b) Does deleting a node with no children from a red-black tree,re-balancing, and then reinserting it with the same key alwaysresult in the original tree?

Please include specific example of a tree showing the originaltree, the results of the re-balancing, and the final tree afterdeleting. Also include an explanation of how the algorithm proceedsto insert and delete nodes in the tree. Include information such aswhich node is the parent, grandparent, and uncle at each step, andwhich node is the argument for the left and