A Poset in which every pair of elements has both a least upper bound and a greatest lower bound is termed as _______
(a) sublattice
(b) lattice
(c) trail
(d) walk
This question was addressed to me in an interview for job.
This is a very interesting question from Graphs topic in section Graphs of Discrete Mathematics