SCHEME LANGUAGE

Given a k-by-k matrix M containing only 0 or 1 values, for k 2,

(a) Write a simple function that determines when any 22 binary matrix M is not one of the

2 2 anti-lonesome matrices,

1 0

0 1

or

0 1

1 0

All other binary matrices are lonesome matrices.

Your function should return #t if M is lonesome. It should return #f otherwise.

(b) If you have a 33 binary matrix M then it is lonesome if dropping any row and dropping

any column does not give a 2 2 anti-lonesome matrix. Write a simple function that

determines when any 3 3 matrix M is lonesome.

Your function should return #t if M is lonesome. It should return #f otherwise.

SCHEME LANGUAGE