Question

when the context free grammar has the production rules of <T> → λ, <T> → (<T>) <T> where T in the metasymbols refers to tree. how do you draw the parse tree for the word ((()))()()(()()) ? lambda is the empty string and ( and ) are the terminals