Consider a mutation operator that replaces boolean variables with the constants "T" and "F".

(a) How many single order mutants does this generate for isSatisfactory()?

(b) How many single order mutants does this generate for isSatisfactoryRefactored()?

(c) Some of these mutants are bound to be redundant. How many? Give one example, if any, and explain why it's a redundant mutant?

(d) Are any of these single order mutants "equivalent". How many?

(e) For each single order mutant, find a test that kills that mutant.