For any integer n lessthanorequalto 0. design a recursive algorithm that computes the total number of 1's in n's binary representation. For example, let A be your algorithm (function), then A(10) should return 2, while A(7) should return 3. Note that your algorithm should have a running time of O(log n). Justify your answer. Note that the input to your algorithm Ls a decimal integer n. You need to do the following: (1) give a description of your algorithm; and (2) give its analysis, ie. recurrence equation and its solution