Which of the following statements about the complexity of the greedy modularity maximization algorithm is true:
a) It is always optimal
b) It has polynomial time complexity
c) It guarantees the global optimum
d) It may result in suboptimal solutions