Recalling the discussion of Section 8.3.1, suppose that all active names are contained in a single, ordered list. An identifier would appear k times in the list if there are currently k active scopes that declare the identifier.
(a) How would you implement the methods defined in Section 8.1.2 so that that RETRIEVESYMBOL finds the appropriate declaration of a given identifier?
(b) Explain why the lookup time does or does not remain O(log)(n))for a list of n entries.