Tight Bounds for the State Complexity of Deterministic Cover Automata