In schema theory of Genetic Algorithms, if 'r' is the number of 'don't care' symbols () in a binary schema, how many distinct bit strings does the schema match?

In genetic algorithms, which selection operator maintains genetic diversity effectively by selecting individuals proportional to their relative rank rather than their raw fitness value?

Which of the following describes Holland's Schema Theorem in the context of Genetic Algorithms?