The number of bits required to store a positive integer can be calculated by counting how many times it takes to divide the number in half for it to reach 0. For example, it requires x bits to store both the numbers 8 and 9 because they will each reach zero after they are divided in half x times: 8/2=4, 4/2=2, 2/2=1, and 1/2=0 requires 4 bits. 9/2=4, 4/2=2, 2/2=1, and 1/2=0 requires 4 bits. The only exception is that it still requires 1 bit to store the number 0! return the number of bits required to store a positive integer.