i'm having a little difficulty finding phrase structure grammars that generate each of these sets:

1) w^2 where w is a bit string of finite length; that is to say a string w repeated twice

and

2) 0^(2^n) with n≥0; that is to say a string of consisting of 0s that appears a power-of-two number of times

can anyone help? thanks beforehand