Q$2.$ Develop a minimum state HLSM that calculates the integer square root of a non$-$negative integer.

The system initializes in the IDLE state, awaiting input.

INPUT$\_$NUMBER is the $8-$bit unsigned integer for which the square root is to be calculated.

The algorithm commences when INPUT$\_$NUMBER is received.

The system employs an iterative calculation method where:

It starts with a SQUARE value of $1.$

It uses a DELTA value beginning at $3.$

It increases SQUARE by DELTA as long as SQUARE is less than or equal to

INPUT$\_$NUMBER.

DELTA is increased by $2$ after each iteration.

Once SQUARE exceeds INPUT$\_$NUMBER, the system will calculate and output the integer

square root, which is derived from the final DELTA value.

The system must handle continuous operations, being ready to accept a new INPUT$\_$NUMBER

after completing a calculation.

Please note : in the following example table, the value of the square root, $($delta$/2)-1,$ occurs in the

row following the square value.

$($a$)$ Draw a minimum state HLSM to represent the above system.

$($b$)$ Draw the circuit representing the data$-$path of this system.

$($c$)$ Draw the control unit and connect it to the data$-$path with correct labeling.