Please implement the following question from Midterm in a programming language. Prepare a PDF document that shows the implementation code (in your desired programming language) in the document in 10pt consolas font. Format the code in borders (select the text, click format from the menu, choose paragraph styles, and select Borders and shading. If you select all the borders, up, down, right, and left, with 1 pt line, click apply). Your report should explain the algorithm and space analysis (best-, average-, worst-case) and its steps. Problem: Suppose that A is an array of n elements. Each element of 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 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