Problem
1. Describe the two ways (named vs. positional) provided by Ada to associate actual and formal parameters.
2. Discuss the EQUIVALENCE statement of FORTRAN in the light of aliasing.
3. A routine may be history-sensitive if it can produce different results when activated twice with the same values as parameters and accessible nonlocal variables. Explain why a language with static memory allocation allows writing history-sensitive routines.