Give Ada code to map from lowercase to uppercase letters, using (a) an array (b) a function Note the similarity of syntax: in both cases upper( ‘a’  ) is ‘A’ . In Section 8.2.2 we noted that in a...

Give Ada code to map from lowercase to uppercase letters, using (a) an array (b) a function Note the similarity of syntax: in both cases upper( ‘a’  ) is ‘A’ . In Section 8.2.2 we noted that in a language with dynamic arrays and a value model of variables, records could have fields whose size is not known at compile time. To accommodate these, we suggested using a dope vector for the record, to track the offsets of the fields. Suppose instead that we want to maintain a static offset for each field. Can we devise an alternative strategy inspired by the stack frame layout of Figure 8.7, and divide each record into a fixed-size part and a variable-size part? What problems would we need to address? (Hint: Consider nested records.)