Seol mar théacs é seo: Complexity of Deterministic and Strongly Nondeterministic Decision Trees for Decision Tables From Closed Classes