Another way to ensure that 1 and 2 are not together is to use 'Gaps' method. Basically, when we are given 'n' objects to be arranged so that 'a' out of them should NOT be together - we first arrange the remaining 'n-a' objects, and then arrange these 'a' objects in the gaps created by those 'n-a' objects.
I will try to explain by this question.
We have to arrange 1, 2, 3, 4, 5 so that 1 and 2 are not together. So lets first arrange the remaining numbers.
Remaining 3 numbers can be arranged in 3! = 6 ways.
Now, for each of these 6 ways, the arranged numbers create 4 gaps:
...3...4...5...
one gap before 3, another gap between 3 and 4, another gap between 4 and 5, and the last gap after 5.
So for every arrangement of those 3 numbers, we have 4 gaps - and we can now place the numbers '1' and '2' in any two out of these 4 gaps (and thus they will not touch each other). Number of ways of doing that = 4P2 (arranging 4 objects at 2 places) = 12 ways.
Thus total ways = 3! * 4P2 = 6*12 = 72. Hence C answer
PS - this same can be extended to any such question. So if we have 7 people out of which A,B,C have to be separated (no two of them can sit together), we can first arrange remaining 4 people in 4! ways, and now out of the 5 gaps created (4 people in a line will create 5 gaps), we can place A,B,C in any of the 3 gaps out of 5 in 5P3 ways (60). Thus total ways = 4! * 5P3 = 24 * 60 = 1440.