The correct option is B 60
For a number to be divisible by 11, difference of sum of alternate digits of the number should be of the form 11n where n∈{0,1,2,3....}
Let the digits be a,b,c,d,e,f
|a+c+e−(b+d+f)|=11n
Therefore, only possible combination is
{a,c,e},{b,d,f}={9,2,1},{7,5,0}
Therefore, required no. of ways =2⋅3!⋅3!−2!⋅3! (∵ 0 cannot be the first digit)
⇒72−12=60