i want the answer all of them please

1. Write a head-recursive method which generates an array with all possible bit strings of size n 2. Make the previous method tail-recursive 3. Re-write the previous method to generate the gray code, which consists of the same output but reordered in a way that successive items are different by exactly one bit. The method should be also recursive. input 1101 10