Answer the following as either red or black. All Red black Trees must satisfy the following properties: - The root of a red black tree is - A parent node and its child cannot both be - The number of nodes must be the same in all paths from the root node to null nodes - An element inserted in a red black tree should always be in a node initially Answer the following as either red or black. All Red black Trees must satisfy the following properties: - The root of a red black tree is - A parent node and its child cannot both be - The number of nodes must be the same in all paths from the root node to null nodes - An element inserted in a red black tree should always be in a node initially