Task 1 120 marks Convert 100110 into binary, octal and hexadecimal bases using successive division method. Then, find radix complement representations of that number for each base (including decimal). Show each and every step of your conversions, provide as much explanation as you can Hint & example (no base conversion shown): 3410 = 1000102 = 428 = 2216 6410 10000002 1008 10016 3410 01000102 0428 02216 3010 00111102 0368 ODE 16 10s 2s compl. 8s compl. 16s compl. compl.] Task 2 120 marks We discussed 3 ways to represent signed numbers. Identify 8-bit binary numbers below and provide their decimal signed form using each of these systems: 1. Sign Magnitude (MSB is 0 when positive and 1 when negative) 2. Simple Complement (in negative numbers, all bits are inverted) 3. Radix Complement (also known as Simple Complement + 1) Numbers to identify (if two possible meanings are possible - state both!): 10101010 00111001 11111111 10010010 00000001 Task 3 [20 marks Perform calculations below assuming that all numbers (including answers) are represented with 6-bit data bits in 2s complement form. Indicate and explain overflow if it happens. Show each and every detail of your calculation. 1. (-24) + (-20) 2. 10 - 26 3.(-12) + 10 4. (-18) - 10 5. 28 + 22