Please create pseudo code for the problem depicted using Java syntax.

1. Write a recursive method in pseudo code that returns the number of 1's in the binary representation of N. Use the fact that this equal to the number of 1's in the representation of N/2, plus 1, if N is odd. [10 Points]