Let a set S = {2, 4, 8, 16, 32} and <= be the partial order defined by S <= R if a divides b. Number of edges in the Hasse diagram of is ______
(a) 6
(b) 5
(c) 9
(d) 4
The question was asked in an interview.
I would like to ask this question from Relations in chapter Relations of Discrete Mathematics