$5.$ This problem will require you to write a leaf procedure $($function$)$ to operate on

strings.

You will pass a string to the function convert$\_$str for case conversion. You will

convert the uppercase alphabetic characters to lowercase and vice$-$versa. You

need to make sure you don$$t apply the conversion to a non$-$alphabetic character.

You need to store the converted characters in the stack.

You can assume a suitable string of at least $10$ characters in your data section

$6.$ This problem will require you to write a non$-$leaf procedure $($call function from

another function$).$

You will still do the same essential coding of Problem $5,$ but here you will test if the

character is an alphabet or not, using a non$-$leaf procedure test$\_$char. This function

will return $1$ for uppercase character, $-1$ for lowercase character and $0$ if it$$s not an

alphabet. You will call test$\_$char from convert$\_$str from this purpose.

Write both of these in LegV$8$ please