The complete bipartite graph Km,n has vertex covering number X and edge covering number Y. X and Y are respectively
a) max(m,n), min(m,n)
b) min(m,n), min(m,n)
c) m+n,mn
d) min(m,n),max(m,n)
Different partially ordered sets may be represented by the same Hasse diagramif they are
a) same
b) lattices with same order
c) isomorphic
d) order-isomorphic