When in doubt, use brute force:
1BT 2BM 1BM 2BT
1BT 2BT 1BT 2BT <-- Counted twice
1BT 2BW 1BW 2BT
1BT 2BR 1BR 2BT
1BT 2BF 1BF 2BT
1BT 2BS 1BS 2BT
1BT 2BU 1BU 2BT
1BT 2GM 1GM 2BT
1BT 2GT 1GT 2BT
1BT 2GW 1GW 2BT
1BT 2GR 1GR 2BT
1BT 2GF 1GF 2BT
1BT 2GS 1GS 2BT
1BT 2GU 1GU 2BT
I think the issue people are having is that they want to distinguish between the two instances of '1BT 2BT', but it doesn't work like that. Let's say I numbered each of the possibilities written above 1 through 28. If I handed you a piece of paper with '1BT 2BT' written on it, could you tell me which number that corresponded to? No - it would be one of two numbers - so the numbering is additional information not given in the problem statement.