AMC 10A 2015 Problem 10

How many rearrangements of a b c d are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either a b or b a.

Answer Choices
A. 0
B. 1
C. 2
D. 3
E. 4