How many rearrangements of abcd are there in which no two adjacent letters are also adjacent letters in the alphabet? For example, no such rearrangements could include either ab or ba.<spanclass=′latex−bold′>(A)</span>0<spanclass=′latex−bold′>(B)</span>1<spanclass=′latex−bold′>(C)</span>2<spanclass=′latex−bold′>(D)</span>3<spanclass=′latex−bold′>(E)</span>4