Answer:
Step-by-step explanation:
Given that a referral code is 2 letters (A-Z, no lowercases) followed by 4 digits (0-9), or it is 2 digits (0-9) followed by four letters (A-Z, no lowercases).
Digits are not allowed to repeat but letters can repeat.
Thus we find that 2 letters can be selected in

Since for numbers repitition is not allowed, 4 digits can be arranged in 9P4 ways
= 9*8*7*6
Total no of ways for I type=
For II type numbers are 2 and letters are 4.
So no of ways = 
total referral codes possible =
![26^2*9*8*7*6+26^4 *9*8\\= 26^2 (9)(8) [42+676]\\= 34946496](https://tex.z-dn.net/?f=26%5E2%2A9%2A8%2A7%2A6%2B26%5E4%20%2A9%2A8%5C%5C%3D%2026%5E2%20%289%29%288%29%20%5B42%2B676%5D%5C%5C%3D%2034946496)