2.5. How many unique schemata exist within strings of length 1 = 10, 20, and 30 when the underlying alphabet is binary? How many unique schemata of order 3 exist in binary strings of length 1 = 10, 20, and 30? Calculate reasonable upper and lower bounds on the number of schemata processed using strings of length 1 = 10, 20, and 30 when the population size m = 50. Assume a significant build- ing block length equal to 10 percent of the total string length 2.5. How many unique schemata exist within strings of length 1 = 10, 20, and 30 when the underlying alphabet is binary? How many unique schemata of order 3 exist in binary strings of length 1 = 10, 20, and 30? Calculate reasonable upper and lower bounds on the number of schemata processed using strings of length 1 = 10, 20, and 30 when the population size m = 50. Assume a significant build- ing block length equal to 10 percent of the total string length