(3) 1a. Determine the prime factorization of 504. 1b. The prime factorization of 42,000 is 24 3 53 7. What is the greatest common divisor of 504 and 42,000? 1c. The prime factorization of 42000 is 24 3 53 7. What is the least common multiple of 504 and 42,000? (4) 2a. Convert the decimal number 173 to binary. 2b. Convert the binary number 11010010 to decimal. 2c. Convert the hexadecimal number A5 to binary. 2d. Convert the binary number 1011100 to hexadecimal. (2) 3. Use Euclid's Algorithm to find the greatest common divisor of 153 and 527. Note: You must demonstrate that you are using Euclid's Algorithm. Simply indicating the greatest common divisor is worth zero points on this problem. (4) 4. Encrypt the message OAHU using f(p) = (3p + 7) mod 26. (1) 5. Find A+B where A = (2) 6. Find AB where A = 3 4 5 2 4 2 5 3 and B = and B = 4 8 6 7 3 6 2 4 1 5 NOTE: There is an error in the PowerPoint for matrices, part two. It describes the meet and join operations correctly, but it reverses them in the answers to the self test questions. The self test for \"meet\" is displaying the correct answer for \"join\" and vice versa. (2) 7. Using a. 0 0 1 1 1 0 1 0 0 and 1 0 1 0 1 1 0 1 0 Express the Meet (2) 8. Find the Boolean product of A = b. Express the Join 1 0 1 0 1 0 0 1 0 1 1 0 and B = 1 0 1 1 0 1 1 0