n attributes each can be present or absent so for the left side we have 2$^{n}$ choice similarly for the right we have 2$^{n}$. Mapping 2$^{n}$ entries to another 2$^{n}$ entries we get 2$^{2n}$. This is an purely discrete math concept we just have to find how many pairs can we make including NULL