May someone please tell me how to solve this question in a simple step by step explanation.

Thanks

Question 3 (25 marks] This problem covers 4-bit binary unsigned division Fill in the table for the Quotient, Divisor and Dividend for each step. You need to provide the DESCRIPTION of the step being performed (shift left, shift right, sub). The value of Divisor is 9 (1001, with additional 0000 bits shown for right shift), Dividend is 11 (initially loaded into the Remainder) Step Description Step 0 Initialization Step 1 REM-REM-DIV Quotient Divisor Remainder 0000 1001 0000 0000 1011 0000 1001 0000 1000 0110 REM 0, sll Q, Q LSB 1 Shift DIV to right No further steps needed once number of steps number of bits 1 Question 3 (25 marks] This problem covers 4-bit binary unsigned division Fill in the table for the Quotient, Divisor and Dividend for each step. You need to provide the DESCRIPTION of the step being performed (shift left, shift right, sub). The value of Divisor is 9 (1001, with additional 0000 bits shown for right shift), Dividend is 11 (initially loaded into the Remainder) Step Description Step 0 Initialization Step 1 REM-REM-DIV Quotient Divisor Remainder 0000 1001 0000 0000 1011 0000 1001 0000 1000 0110 REM 0, sll Q, Q LSB 1 Shift DIV to right No further steps needed once number of steps number of bits 1