Assume 3-bit number division). Complete the table and divide the numbers 2/2, using the first version of algorithm for DIVISION. There are many columns and many rows in the Table below. Use as many columns as you need. Use as many rows as you need. You may NOT need all columns and rows. Iteration Step Divisor Quotient Remainder (Dividend) Initial values m - 2 pts) Problem 4a. How many different representations (numbers) could you create with a 512-bit unsigned number? Give your answer in Decimal. You have to use powers. Answer: - 1 pts) Problem 4b. Write the first (smallest) and last (largest) binary representation (number) of a 24-bit unsigned binary number. First (smallest) representation (Give your answer in Binary): Last (largest) representation _(Give your answer in Binary): - 1 pts) Problem 4c. Write the first (smallest) and last (largest) representation (number) of a 256-bit unsigned binary number in decimal. First (smallest) representation (Give answer in decimal): Last (largest) representation_(Give answer in decimal. You have to use powers.)