There are 100 windows, 2 people and 50 days. One communicate other by breaking windows in any day.

a) How many bits of information he can transfer?

b) First one breaks windows, second one repairs some of them. They want to transfer as many bits as possible every day. Find out algorithm and most possible amount of bits. First one gets information by looking at windows which were repaired, second one - with broken windows.