hello sir , i just want the final answer i dont full answer, i promise to comment and like your solution, please answer all of the question because theres no time post the qusteions anathoer time and i dont want the full answer,only the last answer but please solve all of question ,thank u

1)The best case of finding all string matching using nave algorithm is O(m)

Select one:

True

False

-----------------------

2) After some iterations the array elements are ordered as shown here: 2 4 5 7 1 6 7 9. Then we use bubble sort

Select one:

True

False

--------------------

3)The merge sort can divide the problem of large size n into two parts one of them may have one item

Select one:

True

False

-------------------------------

4) Let the selected chromosome X is 10110 represents array of five bits and the fitness function is f(x)=

decimal (X) - (X[0] XOR X[2] XOR X[4] )*3. The cross over (must increase the fitness function) is one digit which is one of digits 0,2,4, then after cross over the chromosome becomes

a.10111

b.10010

c.10110

d.00110