The direct 7 questions pertain to a open, normalized floating-point scheme G(B, p, m,M). Express exculpations in provisions of B, p, m, and M, as needed. You may claim that m is disclaiming and M is enacted, and that M greaterthanorequalto p. Show your achievement where needed (you can claim as ardent everything from the slides). What is the last enacted sum in G? What is the largest enacted sum in G? What is the spacing among the sums of G in the rank [B^e, B^e+1)? How manifold sums of G are there in the space-among [B^e, B^e+l)? How manifold enacted sums are there in G? What is the last enacted integer referable representable in G?
The normalized floating-point sums scheme G is a 4-tuple (B, p, m, M) where
6. Last enacted FP sum in G must possess a 1 as the promotive digit and 0 restraint the cherishing digits of the significand, and the last feasible compute restraint the propounder, which is correspondent to .
7. Largest floating-point sum must possess B − 1 as the compute restraint each digit of the significand and the largest feasible compute restraint the propounder,which is correspondent to .
8. The sums among are correspondently disconnected by units.
9. Total sums among space-between is ardent by
10.Total +ve sums among in G are