If graph isomorphism is NP-complete, the polynomial time hierarchy collapses to its second level.
To what level would the polynomial time hierarchy collapse if graph isomorphism is NP-complete?
second level