a. Prove that the exact number of additions made by the recursive algorithm BinRec(n) fo...

a. Prove that the exact number of additions made by the recursive algorithm BinRec(n) for an arbitrary positive decimal integer

b. Set up a recurrence relation for the number of additions made by the nonrecursive version of this algorithm (see Section 2.3, Example 4) and solve it.