5.3 Which of the following statements are correct? (a) The number of alignments needed by the Boyer-Moore-Horspool algorithm is always lower than the number of alignments needed by a brute force approach. (b) The binary search algorithm facilitates logarithmic search when the items in a list are sorted, with logarithmic search typically being faster than linear search. (c) The approximation ratio of an algorithm A for a minimization problem P of size n represents the difference between the worst solution produced by algorithm A and the optimal solution, for any input of size n. (d) In the context of regulatory motif finding, the worst possible score for a consensus string is achieved when having an equal mix of possible nucleotides for each position in the consensus string