A strongly connected component is maximal if it cannot be extended. In a DAG (directed acyclic graph), how many strongly connected components does it have?