1. Do every exercise again trying to implement what I did in
some other way.

2. Write a program that reverses every line in a file.
	q homereverse.q filename

3. Write a program that finds the first character of every word in the file.
	q homefindfirstchar.q filename

4. Consider the version of the game nim in which the game starts
with some number N of sticks. In each turn a player can take 1, 2, or 3 sticks.
The player who takes the last stick loses.
Player A begins. You are two design a two player Nim game involving
two communicating processes.
Thus, player A will choose some number of sticks, then send the
remaining number to B, who then chooses and sends the remaining
number back to A.
	q homenimA.q N
	q homenimB.q

Hint: homenimB.q should act as a server, since it just needs to respond.
	
