Problem 14 - Entrance Test

In how many ways can the string 0010 be formed from the letters A, B, C, and D, where A = 0, B = 1, C = 2, and D = 3, such that C and D are never adjacent?