It is clear that some expressions are more complex than others in terms of the number of registers or stack locations they will require. Explain how an AST representing an expression can be traversed to determine the number of registers or stack locations its translation will require. Illustrate your technique on the following expression ((A+B)+(C+D))+((E+F)+(G+H))