Answer:
Step-by-step explanation:
The problem relates to filling 8 vacant positions by either 0 or 1
each position can be filled by 2 ways so no of permutation
= 2 x 2 x 2 x 2 x 2 x 2 x 2 x 2
= 256
b )
Probability of opening of lock in first arbitrary attempt
= 1 / 256
c ) If first fails , there are remaining 255 permutations , so
probability of opening the lock in second arbitrary attempt
= 1 / 255 .
