Que: If the partial order of a set has at most one minimal element, then to test whether it has a non-crossing Hasse diagram its time complexity __________ a. NP-complete b. O(n²) c. O(n+2) d. O(n³) Answer: NP-complete