2. Consider the following Red-Black tree, in which represents a red notr with key x, and represents a black node with key y. 31 27 75 14 58 86 43 62 The following 4 keys are inserted into the red-black tree above in the order as shown. 36, 40, 71, 50. Show what the red black tree looks like after each of these keys is inserted.