On the Complexity of Strongly Connected Components in Directed Hypergraphs