Let T be a binary tree with n nodes. Define a Roman node to be a node v in T, such that the number of descendants in v’s left subtree differ from the number of descendants in v’s right subtree by at most 5. Describe a linear-time method for finding each node v of T, such that v is not a Roman node, but all of v’s descendants are Roman nodes.