This problem concerns the design of a divider for floating-point numbers:

(F₁ x 2^E1)/(F₂ x 2^E2) = F x 2^E               

Assume that F₁ and F₂ are properly normalized fractions (or 0), with negative fractions expressed in 2’s complement. The exponents are integers with negative numbers expressed in 2’s complement. The result should be properly normalized if it is not zero. Fractions are 8 bits including sign, and exponents are 5 bits including sign.

(a) Draw a flowchart for the floating-point divider. Assume that a divider is available that will divide two binary fractions to give a fraction as a result. Do not show the individual steps in the division of the fractions on your flowchart; just say “divide.” The divider requires that |F₂| > |F₁| before division is carried out. 

(b) Illustrate your procedure by computing 0.111 x 2³/1.011 x 2^-2 When you divide F₁ by F₂, you don’t need to show the individual steps, just the result of the division.

(c) Write a Verilog description for the system.