[" A beal poss office is to send M tolograms which are distributed at random over N communication "],[" channels,(N) Each tologram is sent over any channol with oqual probability.Chance that not more "],[" than one telegram will be sent over oach channol is: "],[[" (A) "(n_(G)*M!)/(N'')," (B) "(N_(C_(M))*N_(1))/(M^(N))," (C) "1-(N_(C_(M))*M_(1))/(M^(N))," (D) "1-(N_(M),N_(1))/(N^(M))]]