We have 4C2 = 6 ways of choosing the two numerals, and we need to use all six letters. So if we imagine we've picked our two numerals already, and count our possibilities, we'll then need to multiply by 6 to get the answer, to account for the different choices we could make of the numerals. If we've chosen our eight characters, we have 1 choice for our first character (it must be 'B'), and then if there were no restrictions at all, we could make 7! codes, and the answer would be 6*7!. That's just slightly bigger than 30,000, so answers C, D and E are all impossible, and the restriction will reduce the number of codes, but not by more than 90%, so only answer B is remotely plausible.
If we want to solve exactly, the first character is 'B', and the second cannot be 'D' or 'F', so we have 5 choices for the second character. We then have six slots left to fill. With no restrictions, there would be 6C2 = 15 choices we could make for the two slots we'll put the 'D' and 'F' in. Since they can't be together, we must subtract the 5 pairs of adjacent slots, so we have 10 options for the two slots where we can put 'D' and 'F', and those two letters can be in either order, for 2*10 possible places for those two letters. We then can freely put our last four symbols in the last four slots, so we have 4! possibilities for the last four characters. So the answer is, multiplying all of our choices from every step, 6*5*20*4! = 6*100*24 = 14,400. This problem is quite a bit more cumbersome than any similar official question I've seen, though.