Question

Given ( n ) different objects arranged in a row, then the number of ways of choosing ( k ) of them so that no two of them are consecutive is equal to:
a) ( C(n-k+1, k) )
b) ( C(n-k+1, k-1) )
c) ( C(n-k+1, k+1) )
d) ( C(n-k, k) )