3.3. (12p.) Declare in the memory an array of bytes. The numbers in the array are signed numbers. Write a subroutine maximum that finds the maximum value and stores it in a byte in the memory with a label max.

3.4. (10 p.) Write a subroutine that adds two 64-bit variables. The first number is declared in the memory under the label first (two words, the first is the most significand), the second has a label second.

3.5. (5 p.) Assume that an ASCII character is loaded in r5. Write a subroutine that increments a counter if the character is a letter.

3.6. Draw a block diagram, write and debug a subroutine, which counts the number of 0s in a word, located in the memory. You are supposed to invent an algorithm, where the passes through the loop are equal to the number of 0s. For example, if the half word is 173F(16) your loop has to run 6 times and the count of 0s has to be 6 . (Hint: First significant operation in the loop should be increment (add 1) the given word. What is the next? Read again about logical operations!!!) Please, do not count the number of 1s and then subtract from 32!