Pairwise disjointness test help

Determine whether the following grammar is an LL grammar by performing the pairwise disjointness test, showing the FIRST sets of each RHS of each nonterminal:

A -> aB | b | CBB

B -> aB | bA | aBb

C -> aaA | b | caB

In the above productions upper case letters are nonterminals and lower case letters are terminal symbols.

I am trying to get a better understand of how this works and not sure if I am completely understanding. What I am thinking...

{a,b} and {a,b,a} and {a,b,c} and since all share the first two terminals they are not disjoint thus it fails the pairwise disjoint test and is not an LL grammar.

Is this correct and for the reasons I think it is? I haven't been able to find an example/explanation that is clear to me. I'd like a better explanation of the rules so I better understand. Thanks for any help you all can offer!

Re: Pairwise disjointness test help

actually after some more reading I think it should be:

{a,b} and {a,b,a}

{a,b,a}

{a,b,c} and {a,b}

I think this still fails because {a,b} is contained in A and C and {a,b,a} is contained in A and B. I am still unsure of all the rules and reasoning so any guidance would be greatly appreciated!