Consider the following directed left-leaning red-black tree. Edges point from each parent to its child.

The following operations are then performed in order:

• Insert 33
• Insert 50
• Insert 13

Assume that inserting a key already present in the tree leaves the tree unchanged.

Tick all keys that are at red nodes in the resulting tree.