Problem: Suppose that \( \mathrm{A} \) is an array of \( \mathrm{n} \) elements. Each element of \( \mathrm{A} \) has some flavor; you cannot tell the flavors apart, but you know that one flavor is a strict majority. That is, there are strictly more than \( \mathrm{n} / 2 \) elements that have this one flavor. You can access a helper function called isMajority so that isMajority \( (A, x) \) returns True if \( x \) is an element of \( A \) with the majority flavor and False otherwise. Develop an \( O(n) \) complexity divide-and-conquer algorithm to return an element of the majority flavor.