Implement a Red-Black tree using the code provided in section 3.3 and problems 3.39-3.41. Insert the keys 1 to 60 in increasing order into an empty tree. Draw the resulting tree by hand. Then delete keys 1 to 20 in increasing order. Draw the resulting tree after deleting the first 20 numbers (i.e., after deleting 1-20). You can draw the tree by hand. You can list the nodes using an in-order or similar traversal and use that to draw the tree