Find $A^n$ for n=0,1, and 3: Languages and Finite State Machines

Question

The question is:

Let $A$={11,00}.

Find $A^n$ for n=0,1, and 3.

Would i be right in thinking that

$A^0$ = {λ} $A^1$ = {11,00} $A^3$ = {111111,111100,110011,110000,000011,000000,001100,001111}.

if not, please could you help point me in the right drection?