1(3 points) A certain online vendor requires each of its registered users to choose a password that must be 7 characters long and subject to the following: The 1st character must be an uppercase letter (A' through 'Z). The 2nd character must be one of 8 specified (non-alphanumeric) symbols. (NOTE: You don't have to know what exactly these 8 symbols are.) . The 3rd character must be one of the digits (O' through 9). Each of the remaining (4th throuth 7th) characters can be any combination of uppercase or lowercase letters, digits, or symbols, where the symbols are from the 8 specified symbols. How many different (distinct) passwords can be supported using the above rules?. NOTE: You can leave your answer as an expression involving terms containing numbers raised to certain powers CAUTION: You will earn NO CREDITS if you don't clearly show working (i.e., how you arrive at the required quantity 2 (3 points) Using Horner's scheme, represent (evaluate) the binary unsigned whole number 10010101 in decimal. CAUTION: You will earn NO CREDITS if you don't use Horner's scheme to more efficiently evaluate polynomial You will earn NO CREDITS if you simply show the final result and not clearly show working e,intermediate steps 3 (3 points) Using Horner's scheme, represent (evaluate) the base-7 unsigned whole number 1243 in decimal. CAUTION: You will earn NO CREDITS if you don't use Horner's scheme to more efficiently evaluate polynomial You will earn NO CREDITS if you simply show the final result and not clearly show working (i.e., intermediate steps) 4 (3 points) Using the repeated division method, represent the decimal unsigned whole number 302 in binary. CAUTION: You will earn NO CREDITS if you simply show the final result and not clearly show working (i.e, intermediate steps) 5 (3 points) Re-write the result obtained in the preceding question (decimal unsigned whole number 302 in binary) in hex CAUTION: You will earn NO CREDITS if you simply show the final result and not clearly show working (i.e. how you group the bits)