1. he code for mod-and-div-faster as written uses hi := n + 1 as the initial upper bound. Why is this assignment an acceptable for the correctness of the algorithm? Explain briefly. 2. Describe an...

1. he code for mod-and-div-faster as written uses hi := n + 1 as the initial upper bound. Why is this assignment an acceptable for the correctness of the algorithm? Explain briefly.

2. Describe an algorithm that finds a better upper bound hi, by repeatedly doubling hi until it’s large enough.