Write an algorithm (Divide-and-Conquer) for the below problem: In the context of the selection of the next European Capital of Culture, you are tasked with proposing an algorithm which, based on the votes of the board members, decides whether the members have determined the next European Capital of Culture. According to the regulations, the city which is voted for by more than members, where is the number of council members, is chosen as European capital of culture. In the event that no candidate city secures the required number of votes, only the two cities with the highest number of votes from the ballot remain on the ballot and a new election is held. Each member votes electronically for the city of their choice and their vote is entered into a voting sequence. Given this sequence of n (not necessarily distinct) votes, we designate a city as the next cultural capital of Europe if its name appears more than times within the sequence. For example, the sequence {Heraklion, Paphos, Prague, Lyon, Heraklion, Genoa, Prague, Paphos, Florence, Barcelona, Cork, Prague, Florence, Genoa, Lyon, Barcelona} does not elect a cultural capital, while Paphos is the next cultural capital capital of Europe resulting from the sequence {Paphos, Lyon, Paphos, Heraklion, Paphos, Genoa, Paphos, Paphos, Paphos, Prague, Paphos, Florence, Paphos, Barcelona, Lyon, Paphos} You are invited to design and analyze a Divide algorithm -Rule that if exists, find and return the cultural capital in a sequence of n votes (for convenience consider n to be a power of 2), otherwise return that no cultural capital is elected. Your algorithm should have time complexity.