1. This question is about inserting and deleting in a balanced tree. la) One by one…

1. This question is about inserting and deleting in a balanced tree. la) One by one insert the letters of the sequence of DATASTRUCTURES into a 2-tree tree. At each step show the status of the tree, and if there are 4-nodes created, show the details of their splitting. lb) Repeat part a) but this time use red-black trees. There should be a one-to-one correspondence between your red-black trees and your 2-3 trees. 1c) Now delete the minimum element from the 2-3 tree. (No need to do it for the red-black tree.)