5. Can we maintain rank in nodes of a red-black tree as attributes without affecting the O(lgn) performance of insertion and deletion operations? What if we maintain both rank and size at the same time? Justify your answers