[Solved] SOLVED: Pairwise disjointness test

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 – aAb | bBB B – aB | bA | Cc C – aaB | c | caB In the above productions upper case letters are nonterminals and lower case letters are terminal symbols.