In a poset (S, ⪯), if there is no element n∈S with m<n, then which of the following is true?
(a) an element n exists for which m=n
(b) An element m is maximal in the poset
(c) A set with the same subset of the poset
(d) An element m is minimal in the poset
I have been asked this question in an interview for internship.
I want to ask this question from Graphs in portion Graphs of Discrete Mathematics