Design and write recursive functions over the natural numbers.
Write a recursive procedure, (bounded-power-of-2 n), that finds the largest integer power of 2 less than of equal to the positive integer n.
(bounded-power-of-2 1)
1
(bounded-power-of-2 3)
2
(bounded-power-of-2 7)
4
(bounded-power-of-2 16)
16