According to the code below, which violation is detected first? 1 // insert the key-value pair in the subtree rooted at h 2 private Node put(Node h, key key, Value val) { 3 if (h == null) return new Node(key, val, RED, 1); 4 5 int cmp = key.compareTo(h.key); 6 if (cmp 0) h.right = put(h.right, key, val); 8 else h.val = val; 9 10 // fix-up any right-leaning links 11 if (isRed(h.right) && !isRed(h.left)) h = rotateLeft(h); 12 if (isRed(h.left) && isRed(h.left.left)) h = rotateRight(h); 13 if (isRed(h.left) && isRed(h.right)) flipcolors(h); h.size = size(h.left) + size(h.right) + 1; 15 16 return h; 17 } 14 the root node is red O more than one red edge is connected to a node O a right-leaning red edge O the number of black edges in all root-to-leaf paths is not the same Which part of the following code is responsible for detecting violations when inserting into red- black BSTS? 1 // insert the key-value pair in the subtree rooted at h 2 private Node put(Node h, Key key, Value val) { 3 if (h == null) return new Node(key, val, RED, 1); 4 5 int cmp = key.compareTo(h.key); 6 if (cmp 0) h.right = put(h.right, key, val); 8 else h.val = val; 9 // fix-up any right-leaning links if (isRed(h.right) && !isRed(h. left)) h = rotateLeft(h); 12 if (isRed(h.left) && isRed(h.left.left)) h = rotateRight(h); 13 if (isRed(h.left) && isRed(h.right)) flipcolors(h); 14 h.size = size(h.left) + size(h.right) + 1; 15 return h; 17 } 10 11 16 O line 3 lines 5-8 O lines 11-13 Violations of the red-black BST properties are detected: O going down from root to leaf (i.e., before the recursive calls) O going up from leaf to root (i.e., after the recursive calls) O in both directions