Alphabits

A string of five binary digits ("bits") can represent 32 different numbers (0 to 31), enough to encode the alphabet. For example:




1	0	1	0	1	=	21	=	U

We're using the "A=1, B=2, Z=26" system. Slots 27-31 are filled with E,T,A,O,N.

These 8 puzzles each involve a 5x5 grid of bits. Reading each row from left to right produces a 5-letter word on the right side of the grid. Reading each column from top to bottom produces a 5-letter word below the grid.

For example: in the first grid, the first row (10011) produces the letter S. The third column (00001) produces the letter A.

All answers use common words.

#	Binary	Letter
0	00000	(blank)
1	00001	A
2	00010	B
3	00011	C
4	00100	D
5	00101	E
6	00110	F
7	00111	G
8	01000	H
9	01001	I
10	01010	J
11	01011	K
12	01100	L
13	01101	M
14	01110	N
15	01111	O
16	10000	P
17	10001	Q
18	10010	R
19	10011	S
20	10100	T
21	10101	U
22	10110	V
23	10111	W
24	11000	X
25	11001	Y
26	11010	Z
27	11011	E
28	11100	T
29	11101	A
30	11110	O
31	11111	N

In each grid, change one bit to make two 5-letter words.


					S
					H
					I
					R
					O

S	M	A	S	T


					A
					M
					O
					N
					E

G	O	N	G	E

In each grid, change two bits to make two 5-letter words.
(Hint: Only two letters on each side will change.)


					A
					R
					O
					P
					T

E	T	U	L	T


					C
					O
					T
					O
					S

M	N	N	E	S

In each grid, fill the empty bits to make two identical words.
(Hint: The layout will be symmetrical along the axis shown.)


					?
					?
					?
					?
					?

?	?	?	?	?


					?
					?
					?
					?
					?

?	?	?	?	?

In each grid, fill the empty bits to make two different words.


					?
					?
					?
					?
					?

?	?	?	?	?


					?
					?
					?
					?
					?

?	?	?	?	?