Can someone please explain to me how they solved these. I worked through the problems, but I'm not sure I've gotten the correct answer. A good explanation would be extremely helpful.

Each of the matrices below represents a relation on a set. For each, prove whether the represented relation is a partial order, and if so, draw the corresponding Hasse diagram.

(a) [ 1 0 1

1 1 0

0 0 1 ]

(b) [ 1 0 1 0

0 1 1 0

0 0 1 1

1 1 0 1

Let S = { n² | n = 1,2,3...10}.(S,|) is a partial ordering.

Draw the Hasse diagram.

It is not a lattice.Why not?

Add one value to the set to make it a lattice. It should be as small as possible.