Okay, I will do the easy one!

1. There are exactly two partitions of a two-element set {\\(\\bullet,\ast\\)}, _viz._ {{\\(\bullet\\)}, {\\(\ast\\)}}, and {{\\(\\bullet,\ast\\)}}. The first partition is finer than the second, from which we can draw the corresponding Hasse diagram in the obvious way.

1. There are exactly two partitions of a two-element set {\\(\\bullet,\ast\\)}, _viz._ {{\\(\bullet\\)}, {\\(\ast\\)}}, and {{\\(\\bullet,\ast\\)}}. The first partition is finer than the second, from which we can draw the corresponding Hasse diagram in the obvious way.