Question 1\\ Read the following algorithm ! Algorithm for converting a fraction I into binary with ` binary places . Inputs : fraction I E !, I _ _ _ I and number of places DEN. Initialise i + 1 . by. G. ..... 6 + 1 Loop ! if ; = p + 1 stop . If I S 1 | }; + 1. It I - 1| Outputs . hits by . by ..... ... 6 such that lobby ... big is the best approximation to I using " binary places . laj Verify that the algorithm converts* = & to aquint , when ! = 5. Can You spot how to CREATESE & Exactly In repeating binary'" | | | Express U. thing is accurately as possible with & binary places