If we were to insert the node 17 in the following red-black tree with the RB_Insert function (z pointer shows the node to be inserted) the y pointer would show the node 10 RB-INSERT(T.2) TREE-INSERT (T.) z.color = RED while 2* T.roof and z.p.color == RED if z.p == 2.p.p.left y = z.p.p.right if y.color == RED z.p.color = BLACK y.color = BLACK z.p.p.color = RED 2 = 2.P.P else 10 if z == z.p.right 11 2 = 2.7 12 LEFT-ROTATE(T. 2) 13 RIGHT-ROTATE(T. z.p.p) else (same as then clause 14 with "right" and "left" exchanged) 15 T.root.color = BLACK Il case 1 // case 1 Il case 1 Il case 1 Il case 2 Il case 2 // case 3