In this assignment you are to create a Recursion Class that will implement the following recursive algorithms:

$$ Implement a recursive algorithm to compute the integer part of the base$-$two logarithm of n using only addition and integer division as described in problem C$-5\mathrm{.}11$ on page $221$ of the textbook.

$$ Implement a recursive algorithm to compute the product of two positive integers, m and n$,$ using only addition and subtraction as described in problem C$-5\mathrm{.}13$ on page $221$ of the textbook.

You do not need to make a test for it as A client class will be made for it$.$

C$-5\mathrm{.}11$ Describe a recursive algorithm to compute the integer part of the base$-$two logarithm of $n$ using only addition and

integer division.

C$-5\mathrm{.}12$ Describe an efficient recursive algorithm for solving the element uniqueness problem, which runs in time that is

at most $O(n^2)$ in the worst case without using sorting.

C$-5\mathrm{.}13$ Give a recursive algorithm to compute the product of two positive integers, $m$ and $n,$ using only addition and

subtraction.