Can you provide an example of a context-free grammar (CFG) where the number of 'a's and 'b's in a string are the same?

Here is an example of a context-free grammar (CFG) where the number of 'a's and 'b's in a string are the same:

S - aSb bSa SS

In this CFG, 'S' represents a string where the number of 'a's and 'b's are equal. The rules allow for the production of strings with equal numbers of 'a's and 'b's by recursively adding 'a' and 'b' pairs or by combining two strings with equal numbers of 'a's and 'b's. The '' represents an empty string.