. Draw a Hasse Diagram describing a finite partially ordered set with each set of properties: (a) A lattice which is complemented but not uniquely complemented. (b) A Boolean Algebra with 16 elements. (C) A semi-lattice; that is, the join operation is well-defined, but not the meet operation. fg 11 0 12 0 0 0 0 1 1 0 0 0 0 0 0 0 1 1 1 1 23 24 0 0 0 0 0 1 1 1 1 0 0 1 1 1 0 0 0 1 1 0 0 1 0 0 1 0 1 1 1 1 1 0 0 1 1 0 1 0 1 1 0 1 0 1 1 1 0 0 0 0 1 0 0 1 1 0 1 0 0 0 0 1 1 1 1 1 0 1 0 1 0 1 0 1 1 1 1 1 1 1 1 1