Red-black tree insertion fixup after a red-red violation

Build a red-black tree by inserting keys 10, 5, 15, 3 in order, letting the standard insertion-fixup run after each insertion. The tree is now: 10 (black, root), 5 (black, left child of 10), 15 (black, right child of 10), 3 (red, left child of 5, with no children). Key 1 is now inserted as the left child of 3 (red, by ordinary BST insertion), creating a red-red violation between 3 and 1. What does the insertion-fixup do?

2 of 46 in Data Structures & Algorithms