Question

Consider the set $X=\{a,b,c,d,e\}$ under the partial ordering:
$R=\left\{\right(a,a),(a,b),(a,c),(a,d),(a,e),(b,b),(b,c),(b,e),(c,c),(c,e),(d,d),(d,e),(e,e\left)\right\}$
The Hasse diagram of the partial order $(X,R)$ is shown below:

The minimum number of ordered pairs that need to be added to $R$ to make $(X,R)$ a lattice is

• A. 0

Answer 1

The correct option is A 0
Since the given hasse diagram is already a lattice, three is no need to add any ordered pair. So answer is 0.