In how many ways can the letters in BEEKEEPER be rearranged so that two or more Es do not appear together?<spanclass=′latex−bold′>(A)</span>1<spanclass=′latex−bold′>(B)</span>4<spanclass=′latex−bold′>(C)</span>12<spanclass=′latex−bold′>(D)</span>24<spanclass=′latex−bold′>(E)</span>120