Please write a context free grammar (CFG) for the following language:

{All binary strings containing equal number of 0s and 1s in the string}