1. (10 pts) When the eg? function in Scheme is used for comparing symbols it must return #t if and only if wo symbols have guished). E.g. (eg? (eg? (eg? ,x ,x ,x , x) returns#t , X) returns#t , y) returns#f With our current implementation, the parser constructs a new Ident object for every occurrence of a symbol. For comparing symbols, it is, therefore, necessary to use string comparison for comparing the names stored in these Ident objects. Explain, how you would modify your processing of symbols (data structure, lexical analysis, and parsing), so that eq? could be implemented using simple pointer comparison, ie., using in C#, C++, or Java