Questions about the below tree:

Is the above tree a valid red-black binary search tree?

If the tree is not a valid red-black BST, which property(ies) is(are) violated from the following: the root must be black, at most two red edges can be connected to each node, red edges are left-leaning only (i.e., they can only link to left children), the number of black edges in all root-to-leaf paths is the same, the tree is a valid red-black tree

If the tree is not a valid red-black BST, which operation(s) out of the following are used to correct the violation(s): left rotate, right rotate, color flip, the tree is already a valid red-black tree

E C R A H S E C R A H S