algorithms analysis and design

Let the text T= [ABACBACACBACABBA) and the pattern P=[ACAB], we use the boyer moore algorithm, after the first bad cahr comparison, the first char of pattern becomes under the text char Select one: O a. T[2] O b. T[4] O c. T[O] O d. T[1] Suppose a genetic algorithm uses chromosomes of the form x = a1 02 03 04 as with a fixed length of 5 genes. Each gene can be any binary bit (0 or 1). Let the initial population consist of feur individuals with the following chromosomes: x1 = 1 1 1 0 0 x2 = 0 0 0 1 1 x3 = 0 1 0 0 1 x4 = 1 1 0 0 1 Let the fitness function be calculated as: f(x) = decimal (a1 az az 04 as) - 5* (AND (a1 02 03) Then we choose the largest value of fitness function, so the selected chromosome is a. x1 b. x2 O . 3 d. x4